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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Yu, Q., Wang, D., Lin, D., Li, Y., & Wu, C. (2012). A novel two-level hybrid algorithm for multiple traveling salesman problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 497–503). https://doi.org/10.1007/978-3-642-30976-2_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
