An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

Authors:
Pan Junjie;Wang Dingwei
Affiliations:
Northeastern University, China;Northeastern University, China
Venue:
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
Year:
2006

Citing 0
Cited 6

Incorporating psychology model of emotion into ant colony optimization algorithm

MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
Multi-Robot Dynamic Task Allocation Using Modified Ant Colony System

AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Tobacco distribution vehicle routing program and the resolving method

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A Team ant colony optimization algorithm for the multiple travelling salesmen problem with MinMax objective

MIC '08 Proceedings of the 27th IASTED International Conference on Modelling, Identification and Control
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems

Applied Soft Computing
Initial application of ant colony optimisation to statistical disclosure control

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem (TSP). The MTSP can be generalized to a wide variety of routing and scheduling problems.It is known that classical optimization procedures are not adequate for this problem.The paper makes the attempt to show how the ant colony optimization(ACO) can be applied to the MTSP with ability constraint. In this paper,we compare it with MGA by testing several standard problems from TSPLIB.The computational results show that the proposed algorithm can find competitive solutions even not all of the best solutions within rational time, especially for large scale problems.