Some Combinatorial Optimization Problems on which Ant Colony Optimization is Invariant

@inproceedings{Paola2006SomeCO,
  title={Some Combinatorial Optimization Problems on which Ant Colony Optimization is Invariant},
  author={Paola and Mauro},
  year={2006}
}
Ant colony optimization is a well known metaheuristic which has been object of many studies, both theoretic and applicative. In a recent analysis [1], a particular aspect of its behavior is investigated. More in detail, the topic object of interest is the result achieved by ant algorithms when the cost unit in which instances are expressed changes. Three ant colony optimization algorithms are proved to be invariant to this type of transformation of instances, provided that some conditions are… CONTINUE READING