Skip to main content
SpringerLink
Log in

Virtual Loser Genetic Algorithm for Dynamic Environments

  • Conference paper
Applications of Evolutionary Computation (EvoApplications 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7248))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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)

    Chapter  Google Scholar 

  5. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers (2002)

    Google Scholar 

  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. 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. Yang, S., Yao, X.: Population-based incremental learning with associative memory for dynamic environments. IEEE Transactions on Evolutionary Computation 5(12), 542–561 (2008)

    Article  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Coimbra Institute of Engineering, Polytechnic Institute of Coimbra, Portugal

    Anabela Simões

  2. Centre for Informatics and Systems of the University of Coimbra, Portugal

    Anabela Simões & Ernesto Costa

Authors
  1. Anabela Simões
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ernesto Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, University of Strathclyde, 16 Richmond Street, G1 1XQ, Glasgow, UK

    Cecilia Di Chio

  2. Financial Mathematics and Computation Cluster Natural Computing Research and Applications Group Complex and Adaptive Systems Laboratory, University College, Dublin, Ireland

    Alexandros Agapitos

  3. Department of Computer Engineering, University of Parma, Viale Usberti 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  4. ETSI Informática, Universidad de Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  5. Centro Universitario de Merida, Universidad de Extremadura, Spain

    Francisco Fernández de Vega

  6. Dalle Molle Institute for Artificial Intelligence (IDSIA), Lugano, Switzerland

    Gianni A. Di Caro

  7. DFKI Bremen, Cyber-Physical Systems, Bremen, Germany

    Rolf Drechsler

  8. Knowledge Engineering Research Group, Aston University, B4 7ET, Aston Triangle, Birmingham, UK

    Anikó Ekárt

  9. Instituto Tecnológico de Informática, Edif. 8G Acceso B, Universidad Politécnica de Valencia, 46022, Valencia, Spain

    Anna I. Esparcia-Alcázar

  10. Next Generation Intelligent Networks Research Center (nexGIN RC), National University of Computer & Emerging Sciences (FAST-NU), Islamabad, Pakistan

    Muddassar Farooq

  11. Department of Computer Science,, University College London, Gower Street, WC1E 6BT, London, UK

    William B. Langdon

  12. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-GuervĂłs

  13. Chair of Algorithm Engineering, Computational Intelligence Group, Dept. of Computer Science, Technische Universität Dortmund, Germany

    Mike Preuss

  14. HTWK Leipzig, Fakultät Elektrotechnik und Informationstechnik, Institut Mess–, Steuerungs– und Regelungstechnik, Postfach 30 11 66, D–04251, Leipzig, Germany

    Hendrik Richter

  15. INESC-ID Lisboa, Rua Alves Redol 9,, 1000-029, Lisboa, Portugal

    Sara Silva

  16. Centre for Informatics and Systems, University of Coimbra, Portugal

    Anabela Simões

  17. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  18. Institute of High Performance Computing and Networking, ICAR-CNR, Naples, Italy

    Ernesto Tarantino

  19. Dipartimento di Tecnologie dell’Informazione, Universita’ degli Studi di Milano, Italy

    Andrea G. B. Tettamanzi

  20. IT University of Copenhagen, Rued Langaards Vej 7, 2300, Copenhagen, Denmark

    Julian Togelius

  21. Centre for Emergent Computing, Edinburgh Napier University, Edinburgh,, UK

    Neil Urquhart

  22. Department of Computer Engineering, Istanbul Technical University, 34490, Maslak, Turkey

    A. Ĺžima Uyar

  23. Center For Computer Games Research, IT University Of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Georgios N. Yannakakis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simões, A., Costa, E. (2012). Virtual Loser Genetic Algorithm for Dynamic Environments. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2012. Lecture Notes in Computer Science, vol 7248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29178-4_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29178-4_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29177-7

  • Online ISBN: 978-3-642-29178-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation