An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (Quasi-TSP)
Traveling salesman problem (TSP) and its quasi problem (Quasi-TSP) are typical problems in path optimization, and ant colony optimization (ACO) algorithm is considered as an effective way to solve TSP. However, when the problems come to high dimensions, the classic algorithm works with low efficiency and accuracy, and usually cannot obtain an ideal solution. To overcome the shortcoming of the classic algorithm, this paper proposes an improved ant colony optimization (I-ACO) algorithm which combines swarm intelligence with local search to improve the efficiency and accuracy of the algorithm. Experiments are carried out to verify the availability and analyze the performance of I-ACO algorithm, which cites a Quasi-TSP based on a practical problem in a tourist area. The results illustrate the higher accuracy and efficiency of the I-ACO algorithm to solve Quasi-TSP, comparing with greedy algorithm, simulated annealing, classic ant colony algorithm and particle swarm optimization algorithm, and prove that the I-ACO algorithm is a positive effective way to tackle Quasi-TSP.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Affiliations: Key Laboratory of Virtual Geographic Environment, Nanjing Normal University, Ministry of Education, Nanjing, Jiangsu, 210023, China
Publication date: September 2, 2015