Implementing Population-Based ACO

摘要

Population-based ant colony optimization (PACO) is one of the most efficient ant colony optimization (ACO) algorithms. Its strength results from a pheromone memory model in which pheromone values are calculated based on a population of solutions. In each iteration an iteration-best solution may enter the population depending on an update strategy specified. When a solution enters or leaves the population the corresponding pheromone trails are updated. The article shows that the PACO pheromone memory model can be utilized to speed up the process of selecting a new solution component by an ant. Depending on the values of parameters, it allows for an implementation which is not only memory efficient but also significantly faster than the standard approach.