ACOTSPQAP is a software package that implements various Ant Colony Optimization algorithms for the symmetric travelling salesman problem (TSP) and the quadratic assignment problem (QAP). The ACO algorithms implemented are Ant System (AS), Elitist Ant System (EAS), MAX-MIN Ant System (MMAS), Rank-based Ant System (RAS), Best-Worst Ant System (BWAS), and Ant Colony System (ACS). These algorithms may be combined with problem-specific local search.
The goal of this software is to provide a reasonable high-performing
implementation of ACO algorithms under a component-wise framework.
Individuals components of the ACO algorithms can be tuned by using more than
40 command-line parameters (see
The implementation builds upon the earlier ACOTSP package.
This program is free software (software libre); you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
IMPORTANT NOTE: Please be aware that the fact that this program is released as Free Software does not excuse you from scientific propriety, which obligates you to give appropriate credit. If you write a scientific paper describing research that made substantive use of this program, it is your obligation as a scientist to (a) mention the fashion in which this software was used in the Methods section; (b) mention the algorithm in the References section. The appropriate citation is:
Manuel López-Ibáñez, Thomas Stützle, and Marco Dorigo. Ant Colony Optimization: A Component-Wise Overview. Handbook of Heuristics, 2016. (In preparation)