Abstract
Population based ACO algorithms for dynamic optimization problems are studied in this paper. In the population based approach a set of solutions is transferred from one iteration of the algorithm to the next instead of transferring pheromone information as in most ACO algorithms. The set of solutions is then used to compute the pheromone information for the ants of the next iteration. The population based approach can be used to solve dynamic optimization problems when a good solution of the old instance can be modified after a change of the problem instance so that it represents a reasonable solution for the new problem instance. This is tested experimentally for a dynamic TSP and dynamic QAP problem. Moreover the behavior of different strategies for updating the population of solutions are compared.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Bäck, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press, Bristol, New York, 1997.
G. D. Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9:317–365, 1998.
M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992. pp. 140.
M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11–32. McGraw-Hill, 1999.
M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics-Part B, 26:29–41, 1996.
M. Guntsch and M. Middendorf. Pheromone modification strategies for ant algorithms applied to dynamic TSP. In E. B. et al., editor, Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001, number 2037 in Lecture Notes in Computer Science, pages 213–222. Springer Verlag, 2000.
M. Guntsch and M. Middendorf. A population based approach for ACO. In S. C. et al., editor, Applications of Evolutionary Computing-EvoWorkshops 2002: Evo-COP, EvoIASP, EvoSTIM/EvoPLAN, number 2279 in Lecture Notes in Computer Science, pages 72–81. Springer Verlag, 2002.
M. Guntsch, M. Middendorf, and H. Schmeck. An ant colony optimization approach to dynamic TSP. In L. S. et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 860–867. Morgan Kaufmann Publishers, 2001.
J. B. R. Schoonderwoerd, O. Holland and L. Rothkrantz. Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5:168–207, 1996.
T. Stützle and M. Dorigo. ACO algorithms for the quadratic assignment problem. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 33–50. McGraw-Hill, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guntsch, M., Middendorf, M. (2002). Applying Population Based ACO to Dynamic Optimization Problems. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive