BDBComp
Parceria:
SBC
A Importância da Informação Heurística Visibilidade para Algoritmos Baseados em Otimização por Colônia de Formigas Aplicados a Domínios Contínuos

Cassio Rodrigo ContiMauro 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

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD