swMATH ID: 27052
Software Authors: Christian Blum; Andrea Roli; Marco Dorigo
Description: HC-ACO: The Hyper-Cube Framework for Ant Colony Optimization. Ant Colony Optimization (ACO) [2] is a recently proposed metaheuristic approach for solving hard combinatorial optimization problems. The inspiring source of ACO is the foraging behavior of real ants. In most ACO implementations the hyperspace for the pheromone values used by the ants to build solutions is only implicitly limited. In this paper we propose a new way of implementing ACO algorithms, which explicitly de nes the hyperspace for the pheromone values as the convex hull of the set of 0-1 coded feasible solutions of the combinatorial optimization problem under consideration. We call this new implementation the hyper-cube framework for ACO algorithms.
Homepage: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=
Related Software: Tabu search; Swarm-Sync; DOSI; Wasp; Beam-ACO; K_TREE/K_SUBGRAPH
Cited in: 3 Documents

Citations by Year