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 (...
Experiment results show that the vehicle plan derived from the ALNS is much better than the solution found by Gurobi within 10,800s, with an average improvement of 14.90%. Additionally, the pALNS provides better statistical bounds in a shorter time compared to both the ALNS and the ...
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem large neighborhood searchmetaheuristicspickup and delivery problems with time windowsThe pickup and delivery problem with time windows is the problem of ... Demir,Emrah 被引量: 244发表: 2012年 An adaptive large neighborh...
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) ...
The ALNS performs a local search by first removing requests and then reinserting them. The algorithm chooses at each iteration one of three removal operators and one of two reinsertion operators, according to their past performance. The main objective of this paper is to propose a population-...
An ALNS for the one-to-one pickup and delivery TSP with handling costs In this paper, we model and solve the one-to-one pickup and delivery traveling salesman problem with handling costs (PDTSPH). We consider a rear-loaded veh... M Veenstra 被引量: 0发表: 2014年 From point forecast...
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...
Petersen and Ropke =-=[20]-=- present an ALNS for a pickup and delivery problem with a single transfer point, concerning the transportation of flowers in Denmark. The algorithm is evaluated on real-life instances containing up to...Hanne L Petersen and Stefan Ropke. The pickup and ...
Full truckload pickup and delivery requests have to be served within time windows. Trucks are synchronized on pickup or delivery locations based on unitary loading and unloading resources. We propose an Adaptive Large Neighborhood Search (ALNS) to solve this problem. Custom destroy and repair ...
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...