Artificial Bee Colony algorithm for Traveling Salesman Problem

DOI

10.2991/icmmcce-15.2015.94How to use a DOI?

Keywords

Traveling Salesman Problem; Artificial Bee Colony; Combinatorial Optimization

Abstract

Travelling salesman problem (TSP) is a fundamental combinatorial optimization model studied in the operations research community for nearly half a century. It belongs to the class of NP-Complete problems. It has been proved that evolutionary algorithms are effective and efficient, with respect to the traditional methods for solving NP-Complete problems like TSP, with avoidance trapping in local minima areas. Artificial Bee Colony (ABC) is a new swarm-based optimization algorithm, which inspired by the foraging behavior of honey bees. This paper uses artificial bee colony algorithm to solve traveling salesman problems, gives the specific solutions of artificial bee colony algorithm for solving traveling salesman problem, and makes simulation experiment for the problem. The results show that the algorithm can efficiently and quickly find optimal or sub-optimal solutions.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hongwei Jiang
PY  - 2015/12
DA  - 2015/12
TI  - Artificial Bee Colony algorithm for Traveling Salesman Problem
BT  - Proceedings of the 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering 2015
PB  - Atlantis Press
SP  - 468
EP  - 472
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmcce-15.2015.94
DO  - 10.2991/icmmcce-15.2015.94
ID  - Jiang2015/12
ER  -