An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem

  title={An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem},
  author={Weimin Liu and Sujian Li and Fanggeng Zhao and Aiyun Zheng},
  journal={2009 4th IEEE Conference on Industrial Electronics and Applications},
The multiple traveling salesmen problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Though the MTSP is a typical computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing and scheduling problems. The paper proposed an ant colony optimization (ACO) algorithm for the MTSP with two objectives: the objective of minimizing the maximum tour length of all the salesmen… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 13 extracted citations

Hybrid Artificial Intelligent Systems

Lecture Notes in Computer Science • 2015
View 10 Excerpts
Highly Influenced

Multiple traveling salesman problem using novel crossover and group theory

2017 International Conference on Computing, Communication and Automation (ICCCA) • 2017
View 1 Excerpt

An accurate different density distributions cell parameter estimate algorithm based on ant colony optimization

The 2014 International Conference on Control, Automation and Information Sciences (ICCAIS 2014) • 2014
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 26 references

A new approach to solving the multiple traveling salesperson problem using genetic algorithms

European Journal of Operational Research • 2006
View 13 Excerpts
Highly Influenced

A Grouping Genetic Algorithm for the Multiple Traveling Salesperson Problem

International Journal of Information Technology and Decision Making • 2007
View 7 Excerpts
Highly Influenced

Multiple traveling salesman problem and its application to hot rolling planning

Kewei Huang, Dingwei Wang
Application Research of Computers, • 2007

An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06) • 2006
View 1 Excerpt

Lower and Upper Bounds for a Symmetric Multiple Depots, Multiple Travelling Salesman Problem

S. Rathinam, R. Sengupta
Research Report, • 2006
View 1 Excerpt

The multiple traveling salesman problem: an overviewof formulations and solution procedures

Tolga Bektas
Omega, • 2006

Ant Algorithms: Theory and Applications

Programming and Computer Software • 2005

Similar Papers

Loading similar papers…