2012 International Conference on Computational Intelligence and Software Engineering (CiSE 2012)(E-BOOK)

Wuhan,China,2012-12-142012-12-162012

ISBN: 978-1-61896-036-8 Scientific Research Publishing

E-Book 275pp Pub. Date: December 2012

Category: Computer Science & Communications

Price: $100

Title: Solution to TSP Based on MAX-MIN Ant System
Source: 2012 International Conference on Computational Intelligence and Software Engineering (CiSE 2012)(E-BOOK) (pp 199-203)
Author(s): Lei Zhou, Jilin university,College of Computer Science and Technology,Changchun ,China
Yuan Wang, Jilin university,College of Communication Engineering,Changchun ,China
Jiaxin Li, Jilin university,College of Computer Science and Technology,Changchun ,China
Abstract: Specific to the NP complete problem, Traveling Salesman Problem(TSP) is analyzed, modeled and solved by analyzing the advantages and disadvantages of basic ant colony algorithm and adopting MAX-MIN Ant System(MMAS). After debugging and confirming the parameters through a large quantity of computer simulation tests, the shortest path to TSP in China is finally obtained and the shortest path obtained from each simulation is stabilized at the some value. By analyzing the examples and optimizing the program, algorithm complexity is greatly decreased and the calculation time is minimized.
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top