One of the well-studied routing issues is the Pickup and Delivery Problem (PDP). It aims to route a fleet of vehicles based on a depot to satisfy a set of transport requests subject to numerous constraints. In real-life cases, the satisfaction of those requests over a given time slot (...
They show the usefulness of performing transshipments and present a two-phase heuristic to solve the problem. Qu and Bard (2012) use a GRASP metaheuristic approach which applies an adaptive large neighbourhood search (ALNS) in the improvement phase to solve the PDPT. Masson et al. (2013) ...
In their study the pickup and delivery nodes are all located in one region, so all SH vehicles can visit all nodes. To solve the problem, Ghilas et al. use adaptive large neighbourhood search (ALNS) and branch-and-bound in an effort to minimize the total costs (i.e., travel cost ...
This paper studies an extension of the well-known one-to-one pickup-and-delivery problem with time windows. In the latter problem, requests to transport go
pickup and delivery demands of a designated customer base while minimizing the overall route cost. Within this problem domain, drones are authorized to serve multiple customers within their capacity and endurance limits, providing both pickup and delivery services during each trip. However, the ...
This paper regards the route optimization of barges as a pickup and delivery problem (PDP). A Mixed Integer Programming (MIP) model is proposed to formulate the PDP with transshipment of barges, and an Adaptive Large Neighborhood Search (ALNS) is developed to solve the problem efficiently. The...
Location routing problemSimultaneous pickup and deliveryHybrid VPL algorithmThe reverse logistics problem, which involves customer returns and incurs high additional logistics costs, has become a topic of increasing interest. This problem is modeled as the location routing problem with simultaneous pickup ...
The 2E‐PDP‐PT aims to minimize total delivery costs and improve public transport capacity utilization. We formulate a new mathematical model based on a space‐time network and adopt an adaptive large neighborhood search (ALNS) algorithm for the 2E‐PDP‐PT. The effectiveness of the...
We provide an efficient algorithm to solve this new problem: a multi-start, adaptive, large neighborhood search (MS-ALNS). The ALNS has been developed foremost for a PDP (Ropke and Pisinger, 2006) and has also been successfully used for a wide variety of VRPs. Ghilas et al., 2016, ...
Section 3 defines the problem and provides a mathematical model. An adaptive large neighborhood search (ALNS) is developed in Section 4. Section 5 proposes a set of randomly generated instances and compares the results of our ALNS with the ones obtained by the CPLEX solver on the mathematical ...