DocumentCode
3660352
Title
Research on TSP based on ant colony algorithm
Author
Hengliang Shi;Lintao Zheng;Gang Liu
Author_Institution
Information Engineering School, Henan University of Science &
fYear
2015
Firstpage
2048
Lastpage
2051
Abstract
This paper solves the TSP (Travel Salesman Problem) problem using the improved ant colony algorithm, and discusses the influence of several key parameters of ant colony algorithm on the performance of the algorithm. Meanwhile computer simulation is carried out on a large number of data using MATLAB, and the regulation of setting parameters is found by experiments on lots of data. The experiments show that ant colony algorithm has the theory and practice guiding significance on solving practical problems.
Keywords
"Convergence","Heuristic algorithms","Cities and towns","Search problems","Optimization","Biology","Conferences"
Publisher
ieee
Conference_Titel
Information and Automation, 2015 IEEE International Conference on
Type
conf
DOI
10.1109/ICInfA.2015.7279626
Filename
7279626
Link To Document