ACOTSP: A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem. This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP). The ACO algorithms implemented are Ant System, Elitist Ant System, MAX-MIN Ant System, Rank-based version of Ant System, Best-Worst Ant System, and Ant Colony System. Aim of the software: Provide an implementation of ACO algorithms for the symmetric TSP under one common framework. The implementation is reasonably high performing.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Balaprakash, Prasanna; Birattari, Mauro; Stützle, Thomas; Dorigo, Marco: Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (2015)
- López-Ibáñez, Manuel; Stützle, Thomas: Automatically improving the anytime behaviour of optimisation algorithms (2014)
- Balaprakash, Prasanna; Birattari, Mauro; Stützle, Thomas; Dorigo, Marco: Estimation-based metaheuristics for the probabilistic traveling salesman problem (2010)
- Kong, Min; Tian, Peng; Kao, Yucheng: A new ant colony optimization algorithm for the multidimensional Knapsack problem (2008)
Further publications can be found at: http://www.aco-metaheuristic.org/publications.html