/ACO_TSP_Solver

Solve travelling salesman problem with ant colony optimization algorithms

Primary LanguagePython

ACO_TSP_Solver

Solve travelling salesman problem with ant colony optimization algorithms, including implementations of AS(Ant System), MMAS(MAX-MIN Ant System) and ACS(Ant Colony System).

Reference

[1] Marco D, Montes d O M A, Sabrina O, et al. Ant Colony Optimization[J]. Computational Intelligence Magazine IEEE, 2004, 1(4):28-39.

[2] Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems Man & Cybernetics Part B Cybernetics A Publication of the IEEE Systems Man & Cybernetics Society, 1996, 26(1):29.

[3] Stützle T, Hoos H H. MAX-MIN ant system[J]. Future Generation Computer Systems, 2000, 16(9):889-914.

[4] Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.