Abstract
The One-Commodity Pickup-and-Delivery Traveling Salesman Problem (1-PDTSP) is a generalization of the standard travelling salesman problem. 1-PDTSP is to design an optimal tour that minimizes the overall travelled distance through the depot and a set of customers. Each customer requires either a pickup service or a delivery service. We propose a Randomized Multi-start Genetic Algorithm (RM-GA) to solve the 1-PDTSP. Experimental investigations show that the proposed algorithm is competitive against state-of-the-art methods.
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
Brassai, S.T., Iantovics, B., Enachescu, C.: Artificial intelligence in the path planning optimization of mobile agent navigation. Procedia Economics and Finance 3, 243–250 (2012)
Hernandez-Perez, H., Rodrguez-Martn, I., Salazar-Gonzalez, J.J.: A hybrid grasp/vnd heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research 36, 1639–1645 (2009)
Hernandez-Perez, H., Salazar-Gonzalez, J.J.: Heuristics for the one-commodity pickup and delivery traveling salesman problem. Transportation Science 38, 245–255 (2004)
Mladenovic, N., Urosevic, D., Hanafi, S., Ilic, A.: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research 220, 270–285 (2012)
Mosheiov, G.: The travelling salesman problem with pick-up and delivery. European Journal of Operational Research 79, 299–310 (1994)
Rodriguez, A., Ruiz, R.: The effect of the asymmetry of road transportation networks on the traveling salesman problem. Computers & Operations Research 9, 1566–1576 (2012)
Wang, Y.: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Computers & Industrial Engineering 70, 124–133 (2014)
Zhao, F., Li, S., Sun, J., Mei, D.: Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Industrial Engineering 56, 1642–1648 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Yahyaoui, H., Tlili, T., Krichen, S. (2015). A Randomized Multi-start Genetic Algorithm for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9142. Springer, Cham. https://doi.org/10.1007/978-3-319-20469-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-20469-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20468-0
Online ISBN: 978-3-319-20469-7
eBook Packages: Computer ScienceComputer Science (R0)