A novel two-level hybrid algorithm for multiple traveling salesman problems

Authors:
Qingsheng Yu;Dong Wang;Dongmei Lin;Ya Li;Chen Wu
Affiliations:
Department of Electronics and Information, Foshan Polytechnic, Foshan, China;Department of Computer, Foshan University, Foshan, Guangdong, China;Center of Information and Education Technology, Foshan University, Foshan, Guangdong, China;Department of Computer, Foshan University, Foshan, Guangdong, China;Department of Computer, Foshan University, Foshan, Guangdong, China
Venue:
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2012

Citing 4
Cited 0

Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures

PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Simulated Annealing versus Metropolis for a TSP instance

Information Processing Letters
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem

ACC'09 Proceedings of the 2009 conference on American Control Conference

Quantified Score

Hi-index	0.00

Visualization

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.