Abstract
The pickup and delivery traveling salesman problem with last-in-first-out loading (TSPPDL) requires that a set of pickup and delivery requests are fulfilled such that the items to be transported are loaded in LIFO order. We generalize the TSPPDL to consider multiple vehicles as well as a maximum distance constraint for each vehicle; a solution to this problem is a set of routes for each vehicle, and each route can be represented by a tree data structure. To solve this problem practically, we propose a variable neighborhood search (VNS) heuristic using several new search operators. Our VNS approach also includes a dynamic programming component for optimally solving TSPPDL instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science 39(1), 104–118 (2005)
Carrabs, F., Cordeau, J.-F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing 19(4), 618–632 (2007)
Cassani, L., Righini, G.: Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society (AIRO XXXV), Lecce, Italy (September 2004)
Cordeau, J.-F., Iori, M., Laporte, G., González, J.J.S.: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1), 46–59 (2010)
Erera, A.L., Morales, J.C., Savelsbergh, M.: The vehicle routing problem with stochastic demand and duration constraints. Transportation Science (2010)
Felipe, A., Ortuño, M.T., Tirado, G.: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach. Computers & OperationsResearch 36(11), 2983–2993 (2009)
Ladany, S.P., Mehrez, A.: Optimal routing of a single vehicle with loading and unloading constraints. Transportation Planning and Technology 8(4), 301–306 (1984)
Levitin, G., Abezgaouz, R.: Optimal routing of multiple-load AGV subject to LIFO loading constraints. Computer & Operations Research 30(3), 397–410 (2003)
Li, C.-L., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Operations Research 40(4), 790–799 (1992)
Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)
Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and exact algorithms for the multipile vehicle routing problem. OR Spectrum (2009)
Tu, D., Guo, S., Qin, H., Oon, W.-C., Lim, A.: The tree representation of feasible solutions for the tsp with pickup and delivery and LIFO loading. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta, Georgia, USA, pp. 191–196 (July 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, X., Lim, A., Qin, H., Zhu, W. (2011). Multiple Pickup and Delivery TSP with LIFO and Distance Constraints: A VNS Approach. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-21827-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21826-2
Online ISBN: 978-3-642-21827-9
eBook Packages: Computer ScienceComputer Science (R0)