The vehicle routing problem
Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A heuristic for the vehicle routing problem with due times
Computers and Industrial Engineering
A hybrid method based on linear programming and tabu search for routing of logging trucks
Computers and Operations Research
A cooperative strategy for a vehicle routing problem with pickup and delivery time windows
Computers and Industrial Engineering
A local search heuristic for the pre- and end-haulage of intermodal container terminals
Computers and Operations Research
Study on hybrid genetic algorithm for hybrid picking-delivery strategy vehicle routing problem
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Hi-index | 0.01 |
This paper presents a two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows and multiple vehicles (PDPTW). The first stage uses a simple simulated annealing algorithm to decrease the number of routes, while the second stage uses Large neighborhood search (LNS) to decrease total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best solutions on problems with 100, 200, and 600 customers. In particular, it has improved 47% and 76% of the best solutions on the 200 and 600-customer benchmarks, sometimes by as much as 3 vehicles. These results further confirm the benefits of two-stage approaches in vehicle routing. They also answer positively the open issue in the original LNS paper, which advocated the use of LNS for the PDPTW and argue for the robustness of LNS with respect to side-constraints.