Paper Info
Title
Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints.
Abstract
We extend the traveling salesman problem with pickup and delivery and LIFO loading (TSPPDL) by considering two additional factors, namely the use of multiple vehicles and a limitation on the total distance that a vehicle can travel; both of these factors occur commonly in practice. We call the resultant problem the multiple pickup and delivery traveling salesman problem with LIFO loading and distance constraints (MTSPPD-LD). This paper presents a thorough preliminary investigation of the MTSPPD-LD. We propose six new neighborhood operators for the problem that can be used in search heuristics or meta-heuristics. We also devise a two-stage approach for solving the problem, where the first stage focuses on minimizing the number of vehicles required and the second stage minimizes the total travel distance. We consider two possible approaches for the first stage (simulated annealing and ejection pool) and two for the second stage (variable neighborhood search and probabilistic tabu search). Our computational results serve as benchmarks for future researchers on the problem. © 2012 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2012
10.1016/j.ejor.2012.06.019
European Journal of Operational Research
Keywords
Field
DocType
Traveling salesman,Pickup and delivery,Last-in-first-out loading,Distance constraint,Metaheuristic
Bottleneck traveling salesman problem,Traveling purchaser problem,Simulated annealing,Mathematical optimization,Variable neighborhood search,Travelling salesman problem,2-opt,Mathematics,Operations management,Tabu search,Metaheuristic
Journal
Volume
Issue
ISSN
223
1
0377-2217
Citations 
PageRank 
References 
15
0.65
32
Authors
5
Name
Order
Citations
PageRank
Brenda Cheang112510.73
Xiang Gao2371.92
Andrew Lim393789.78
Hu Qin420116.49
Wenbin Zhu521415.34