论文信息 - A Population Based Approach for ACO

A Population Based Approach for ACO

A population based ACO (Ant Colony Optimization) algorithm is proposed where (nearly) all pheromone information corresponds to solutions that are members of the actual population. Advantages of the population based approach are that it seems promising for solving dynamic optimization problems, its finite state space and the chances it offers for designing new metaheuristics. We compare the behavior of the new approach to the standard ACO approach for several instances of the TSP and the QAP problem. The results show that the new approach is competitive.

Martin Middendorf | Michael Guntsch | M. Middendorf | Michael Guntsch

[1] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .

[2] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[3] M Dorigo,et al. Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[4] Thomas Stützle,et al. ACO algorithms for the quadratic assignment problem , 1999 .

[5] Martin Middendorf,et al. Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP , 2001, EvoWorkshops.

[6] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[7] Thomas Stützle,et al. Improvements on the Ant-System: Introducing the MAX-MIN Ant System , 1997, ICANNGA.

[8] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[9] G. Di Caro,et al. Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10] Hartmut Schmeck,et al. An Ant Colony Optimization approach to dynamic TSP , 2001 .

[11] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .

[12] Vittorio Maniezzo,et al. Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..