The Application of Natural Computation for Solving the Traveling Salesman Problems

DOI

10.2991/icitmi-15.2015.137How to use a DOI?

Keywords

Traveling Salesman Problem, natural Computation, Genetic Algorithm, Continuous Hopfield Algorithm, Ant Colony Optimization Algorithm

Abstract

Traveling Salesman Problems is a classical kind of combined optimization problems. Solving TSP effectively can produce very important theoretical value in computable theory, and also has very high applied value in practice. Solving travel salesman problems by using some traditional algorithms is limited, The article discuss several natural computation methods of solving travel salesman problems, including solution of genetic algorithm, solution of continuous Hopfield algorithm and solution of Ant colony optimization algorithm.

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  - Huowen Jiang
AU  - Huanliang Xiong
AU  - Huiyun Zhang
PY  - 2015/10
DA  - 2015/10
TI  - The Application of Natural Computation for Solving the Traveling Salesman Problems
BT  - Proceedings of the 4th International Conference on Information Technology and Management Innovation
PB  - Atlantis Press
SP  - 819
EP  - 823
SN  - 2352-538X
UR  - https://doi.org/10.2991/icitmi-15.2015.137
DO  - 10.2991/icitmi-15.2015.137
ID  - Jiang2015/10
ER  -