Abstract
In this work, we consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), which is an extension of the well-known NP-hard Traveling Salesman Problem. We propose a Genetic Algorithm (GA) based on a specially tailored tour improvement procedure for the TSPPD. Computational experiments are reported on the test instances taken from the literature. The experimental results suggest that the proposed GA yields a promising performance in terms of both accuracy and efficiency compared to existing algorithms in the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anily, S.E., Mosheiov, G.: Traveling Salesman Problem with Delivery and Backhauls. Operations Research Letters 16, 11–18 (1994)
Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An Exact Algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42, 26–41 (2004)
Dongarra, J.J.: Performance of Various Computers Using Standard Linear Equations Software, Technical Report CS-89-85, University of Tennessee CS Dept. (2009)
Gendreau, M., Laporte, G., Vigo, D.: Heuristics for the Traveling Salesman Problem with Pickup and Delivery. Computers and Operations Research 26, 699–714 (1999)
Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)
Hernández-Perez, H., Salazar-González, J.-J.: Heuristics for the One-commodity Pickup and Delivery Traveling Salesman Problem. Transportation Science 38(2), 245–255 (2004)
Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal 44, 2245–2269 (1965)
Miller, C., Tucker, A., Zemlin, R.: Integer Programming Formulation of Traveling Salesman Problem Formulations. Journal of the Association for Computing Machinery 7, 326–329 (1960)
Michalewicz, Z.: Genetic Algorithms + Data structures = Evolutions Programs, pp. 215–219. Springer, Heidelberg (1999)
Michalewicz, Z., David, F.: How To Solve It: Modern Heuristics, pp. 189–224. Springer, Heidelberg (2000)
Mosheiov, G.: Traveling Salesman Problem with Pickup and Delivery. European Journal of Operational Research 79, 299–310 (1994)
Süral, H., Bookbinder, J.: The Single-Vehicle Routing Problem with Unrestricted Backhauls. Networks 41(3), 127–136 (2003)
Zhao, F.-G., Sun, J.S., Li, S.J., Liu, W.-M.: A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery. International Journal of Automation and Computing 6(1), 97–102 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Çınar, V., Öncan, T., Süral, H. (2010). A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12242-2_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-12242-2_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12241-5
Online ISBN: 978-3-642-12242-2
eBook Packages: Computer ScienceComputer Science (R0)