/**
* Implementation of an ACO algorithm for solving the Travelling Salesman Problem (TSP)
* The implementation is based on the approach described in the following paper:
*
* Ilie, S., Badica, A., and Badica, C. Distributed agent-based ant colony optimization
* for solving traveling salesman problem on a partitioned map. In Proceedings of the
* International Conference on Web Intelligence, Mining and Semantics (WIMS '11),
* Article No. 23, ACM New York, NY, USA, 2011.
*
* http://dl.acm.org/citation.cfm?id=1988716
*/
package siebog.agents.xjaf.aco.tsp;