Virtual Loser Genetic Algorithm for Dynamic Environments

  • Anabela Simões
  • Ernesto Costa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7248)


Memory-based Evolutionary Algorithms in Dynamic Optimization Problems (DOPs) store the best solutions in order to reuse them in future situations. The memorization of the best solutions can be direct (the best individual of the current population is stored) or associative (additional information from the current population is also stored). This paper explores a different type of associative memory to use in Evolutionary Algorithms for DOPs. The memory stores the current best individual and a vector of inhibitions that reflect past errors performed during the evolutionary process. When a change is detected in the environment the best solution is retrieved from memory and the vector of inhibitions associated to this individual is used to create new solutions avoiding the repetition of past errors. This algorithm is called Virtual Loser Genetic Algorithm and was tested in different dynamic environments created using the XOR DOP generator. The results show that the proposed memory scheme significantly enhances the Evolutionary Algorithms in cyclic dynamic environments.


Evolutionary Algorithm Dynamic Environment Knapsack Problem Associative Memory Good Individual 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report TR AIC-90-001, Naval Research Laboratory (1990)Google Scholar
  2. 2.
    Grefenstette, J.J.: Genetic algorithms for changing environments. In: Männer, R., Manderick, B. (eds.) Proceedings of PPSN II, pp. 137–144 (1992)Google Scholar
  3. 3.
    Simões, A., Costa, E.: Variable-Size Memory Evolutionary Algorithm to Deal with Dynamic Environments. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 617–626. Springer, Heidelberg (2007)Google Scholar
  4. 4.
    Yang, S.: Explicit memory schemes for evolutionary algorithms in dynamic environments. In: Yang, S., Ong, Y.S., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51, pp. 3–28. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers (2002)Google Scholar
  6. 6.
    Simões, A., Costa, E.: Prediction in evolutionary algorithms for dynamic environments using markov chains and nonlinear regression. In: Proceedings of GECCO 2009, pp. 883–890. ACM Press (2009)Google Scholar
  7. 7.
    Trojanowski, K., Michalewicz, Z.: Searching for optima in nonstationary environments. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1999), pp. 1843–1850. IEEE Press (1999)Google Scholar
  8. 8.
    Yang, S., Yao, X.: Population-based incremental learning with associative memory for dynamic environments. IEEE Transactions on Evolutionary Computation 5(12), 542–561 (2008)CrossRefGoogle Scholar
  9. 9.
    Yang, S., Richter, H.: Hyper-learning for population-based incremental learning in dynamic environments. In: IEEE Congress on Evolutionary Computation, CEC 2009, pp. 682–689 (May 2009)Google Scholar
  10. 10.
    Barlow, G.J., Smith, S.F.: A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Drechsler, R., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., McCormack, J., O’Neill, M., Romero, J., Rothlauf, F., Squillero, G., Uyar, A.Ş., Yang, S. (eds.) EvoWorkshops 2008. LNCS, vol. 4974, pp. 606–615. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Sebag, M., Schoenauer, M., Ravisé, C.: Toward civilized evolution: Developing inhibitions. In: Bäck, T. (ed.) Proceedings of the 7th Int. Conference on Genetic Algorithms (ICGA 1997), pp. 291–298. Morgan Kaufmann, San Francisco (1997)Google Scholar
  12. 12.
    Mitchell, M., Forrest, S., Holland, J.: The royal road for genetic algorithms: fitness landscape and GA performance. In: Varela, F.J., Bourgine, P. (eds.) Proceedings of the First European Conference on Artificial Life, pp. 245–254. MIT Press (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anabela Simões
    • 1
    • 2
  • Ernesto Costa
    • 2
  1. 1.Coimbra Institute of EngineeringPolytechnic Institute of CoimbraPortugal
  2. 2.Centre for Informatics and Systems of the University of CoimbraPortugal

Personalised recommendations