Cassio Rodrigo Conti,  Mauro Roisenberg. 

Ant Colony Optimization (ACO) is an optimization metaheuristic ba- sed in the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO for continuous domains have been proposed, but even those with close similarity with classical (discrete domain) ACO do not use the heuristic infor- mation called visibility commonly used in the original ACO algorithm. In this paper we show the importance of the visibility in ACO and propose its imple- mentation for a continuous domain ACO algorithm. The improvement in con- vergence speed is shown in results of experiments when the visibility heuristic is used.

http://www.lbd.dcc.ufmg.br/colecoes/enia/2011/0038.pdf

Processando consulta.