DocumentCode
3347208
Title
TSP Optimization by the Cellular Ant Algorithm
Author
Zhi-yi, Cao ; Yan-qi, Bai ; Xiao, Sun
Author_Institution
Dept. of Comput. Eng., Ordnance Eng. Coll., Shijiazhuang, China
fYear
2011
fDate
21-23 Oct. 2011
Firstpage
274
Lastpage
276
Abstract
This paper proposes a new kind of algorithm, the cellular ant algorithm, to solve the Minimum Ratio TSP( MRTSP). It expresses the cellular ant algorithm´s mathematics model and detail account steps, get the good effect through experimental method to optimize the function.
Keywords
ant colony optimisation; travelling salesman problems; TSP optimization; cellular ant algorithm; minimum ratio TSP; Automata; Cities and towns; Mathematical model; Optimization; Traveling salesman problems; Ant colony algorithm; Cellular ant algorithm; Minimum Ratio TSP; TSP; cellular automata; function optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Instrumentation, Measurement, Computer, Communication and Control, 2011 First International Conference on
Conference_Location
Beijing
Print_ISBN
978-0-7695-4519-6
Type
conf
DOI
10.1109/IMCCC.2011.75
Filename
6154053
Link To Document