A Novel Two-Level Hybrid Algorithm for Multiple Traveling Salesman Problems

  • Qingsheng Yu
  • Dong Wang
  • Dongmei Lin
  • Ya Li
  • Chen Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7331)


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.


multiple traveling salesmen problem two-level hybrid algorithm crossover operator chromosome encoding 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)zbMATHGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Greco, F.: Traveling Salesman Problem. InTech (2008)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Likas, A., Vlassis, N.A., Verbeek, J.J.: The global k-means clustering algorithm. Pattern Recognition 36(2), 451–461 (2003)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Meer, K.: Simulated Annealing Versus Metropolis for a TSP instance. Information Processing Letters 104(6), 216–219 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    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)zbMATHGoogle Scholar
  13. 13.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Qingsheng Yu
    • 1
  • Dong Wang
    • 2
  • Dongmei Lin
    • 3
  • Ya Li
    • 2
  • Chen Wu
    • 2
  1. 1.Department of Electronics and InformationFoshan PolytechnicFoshanChina
  2. 2.Department of ComputerFoshan UniversityFoshanChina
  3. 3.Center of Information and Education TechnologyFoshan UniversityFoshanChina

Personalised recommendations