Abstract
Multiple traveling salesmen problem is a NP-hard problem. The method for solving the problem must arrange with reason all cities among traveling salesman and find optimal solution for every traveling salesman. In this paper, two-level hybrid algorithm is put forward to take into account these two aspects. Top level is new designed genetic algorithm to implement city exchange among traveling salesmen with the result clustered by k-means. Bottom level employs branch-and-cut and Lin-kernighan algorithms to solve exactly sub-problems for every traveling salesman. This work has both the global optimization ability from genetic algorithm and the local optimization ability from branch-and-cut.
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
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega: The International Journal of Management Science 34(3), 209–219 (2006)
Greco, F.: Traveling Salesman Problem. InTech (2008)
Oberlin, P., Rathinam, S., Darbha, S.: A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem. In: Proceedings of the 2009 Conference on American Control Conference, pp. 1292–1297. IEEE Press, Piscataway (2009)
Diaby, M.: Linear Programming Formulation of the Multi-Depot Multiple Traveling Salesman Problem with Differentiated Travel Costs. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications. InTech (2010)
Likas, A., Vlassis, N.A., Verbeek, J.J.: The global k-means clustering algorithm. Pattern Recognition 36(2), 451–461 (2003)
Lin, D.-M., Wang, D., Li, Y.: Two-level degradation hybrid algorithm for multiple traveling salesman problem. Application Research of Computers 28(8), 2876–2879 (2010)
Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.: Ant Colony Optimization for real world vehicle routing problems. Swarm Intelligence 1(2), 135–151 (2007)
Ding, C., Cheng, Y., He, M.: Two level genetic algorithm for clustered Travelling Salesman Problem with Application in large scale TSPs. Tsinghua Science and Technology 12(4), 459–465 (2007)
Schabauer, H., Schikuta, E., Weishaupl, T.: Solving Very Large Travelling Salesman Problems by SOM parallelization on cluster architecture. In: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT), pp. 954–958 (2005)
Meer, K.: Simulated Annealing Versus Metropolis for a TSP instance. Information Processing Letters 104(6), 216–219 (2007)
Wang, D., Wu, X.-B., Mao, X.-C., Liu, W.-J.: Accurate solving hybrid algorithm for small scale TSP. Systems Engineering and Electronics 30(9), 1693–1696 (2008)
Traveling Salesman Problems Library, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, Q., Wang, D., Lin, D., Li, Y., Wu, C. (2012). A Novel Two-Level Hybrid Algorithm for Multiple Traveling Salesman Problems. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30976-2_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-30976-2_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30975-5
Online ISBN: 978-3-642-30976-2
eBook Packages: Computer ScienceComputer Science (R0)