Abstract
In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been developed for EAs to increase the diversity of the population and enhance the performance of the algorithm for DOPs. Among these approaches, immigrants schemes have been found beneficial for EAs for DOPs. In this paper, random, elitism-based, and hybrid immigrants schemes are applied to ant colony optimization (ACO) for the dynamic travelling salesman problem (DTSP). The experimental results show that random immigrants are beneficial for ACO in fast changing environments, whereas elitism-based immigrants are beneficial for ACO in slowly changing environments. The ACO algorithm with hybrid immigrants scheme combines the merits of the random and elitism-based immigrants schemes. Moreover, the results show that the proposed algorithms outperform compared approaches in almost all dynamic test cases and that immigrant schemes efficiently improve the performance of ACO algorithms in DTSP.
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
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. on Syst., Man and Cybern., Part B: Cybern. 26(1), 29–41 (1996)
Dorigo, M., Stüzle, T.: Ant Colony Optimization. The MIT Press, London (2004)
Eyckelhof, C.J., Snoek, M.: Ant Systems for a Dynamic TSP. In: ANTS 2002, Proc. of the 3rd Int. Workshop on Ant Algorithms, pp. 88–99 (2002)
Grefenestette, J.J.: Genetic algorithms for changing environments. In: Proc. of the 2nd Int. Conf. on Parallel Problem Solving from Nature, pp. 137–144 (1992)
Guntsch, M., Middendorf, M.: Applying population based ACO to dynamic optimization problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 111–122. Springer, Heidelberg (2002)
Guntsch, M., Middendorf, M.: A population based approach for ACO. In: EvoWorkshops 2002: Appl. of Evol. Comput., pp. 72–81 (2002)
Guntsch, M., Middendorf, M.: Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: EvoWorkshops 2001: Appl. of Evol. Comput., pp. 213–222 (2001)
Guntsch, M., Middendorf, M., Schmeck, H.: An ant colony optimization approach to dynamic TSP. In: Proc. of the 2001 Gen. and Evol. Comput. Conf., pp. 860–867 (2001)
Guo, T., Michalewicz, Z.: Inver-over operator for the TSP. In: Proc. of the 5th Int. Conf. on Parallel Problem Solving from Nature, pp. 803–812 (1998)
Holland, J.: Adaption in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments - a survey. IEEE Trans. on Evol. Comput. 9(3), 303–317 (2005)
Stüzle, T., Hoos, H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Proc. of the 1997 IEEE Int. Conf. on Evol. Comput., pp. 309–314 (1997)
Yang, S.: Genetic algorithms with memory and elitism based immigrants in dynamic environments. Evol. Comput. 16(3), 385–416 (2008)
Yang, S.: Genetic algorithms with elitism based immigrants for changing optimization problems. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 627–636. Springer, Heidelberg (2007)
Yang, S.: Memory-based immigrants for genetic algorithms in dynamic environments. In: Proc. of the 2005 Genetic and Evol. Conf., vol. 2, pp. 1115–1122 (2005)
Yu, X., Tang, K., Chen, T., Yao, X.: Emprical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Comput. 1(1), 3–24 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mavrovouniotis, M., Yang, S. (2010). Ant Colony Optimization with Immigrants Schemes in Dynamic Environments. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-15871-1_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15870-4
Online ISBN: 978-3-642-15871-1
eBook Packages: Computer ScienceComputer Science (R0)