Skip to main content
SpringerLink
Log in

Prediction in evolutionary algorithms for dynamic environments

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Evolutionary algorithms have been widely used to solve dynamic optimization problems. Memory-based evolutionary algorithms are often used when the dynamics of the environment follow some repeated behavior. Over the last few years, the use of prediction mechanisms combined with memory has been explored. These prediction techniques are used to avoid the decrease of the algorithm’s performance when a change occurs. This paper investigates the use of prediction methods in memory-based evolutionary algorithms for two distinct situations: to predict when the next change will happen and how the environment will change. For the first predictor two techniques are explored, one based on linear regression and another supported by nonlinear regression. For the second, a technique based on Markov chains is explored. Several experiments were carried out using different types of dynamics in two benchmark problems. Experimental results show that the incorporation of the proposed prediction techniques efficiently improves the performance of evolutionary algorithms in dynamic optimization problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Barlow GJ, Smith SF (2008) A memory enhanced evolutionary algorithm for dynamic scheduling problems. In: Applications of evolutionary computing. Lecture notes in computer science, vol. 4974. Springer, Berlin, pp 606–615

  • Ben-Romdhane H, Alba E, Krichen S (2013) Best practices in measuring algorithm performance for dynamic optimization problems. Soft Comput 17(6):1005–1017

    Article  Google Scholar 

  • Bosman PAN, La Poutré H (2006) Computationally intelligent online dynamic vehicle routing by explicit load prediction in evolutionary algorithm. In: Proceedings of parallel problem solving from nature. Lecture notes in computer science, vol 4193. Springer, Berlin, pp 312–321

  • Bosman PAN, La Poutré H (2007) Inventory management and the impact of anticipation in evolutionary stochastic online dynamic optimization. In: Proceedings of the IEEE congress on evolutionary computation. IEEE Press, New York, pp 268–275

  • Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer Academic Publishers, Dordrecht

  • Cobb HG, Grefenstette JJ (1993) Genetic algorithms for tracking changing environments. In: Proceedings of the fifth international conference on genetic algorithms. Morgan Kaufmann, Menlo Park, pp 523–530

  • Cruz C, Gonzlez J, Pelta D (2011) Optimization in dynamic environments: a survey on problems, methods and measures. Soft Comput 15(7):1427–1448

    Article  Google Scholar 

  • De Jong K (2006) Evolutionary computation: a unified approach. MIT Press, Massachusetts

  • Goldberg DE, Smith RE (1987) Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Grefenstette JJ (ed) Proceedings of the second international conference on genetic algorithms. Lawrence Erlbaum Associates, UK, pp 59–68

  • Grefenstette JJ (1992) Genetic algorithms for changing environments. In: Männer R, Manderick B (eds) Parallel problem solving from nature (PPSN II)

  • Hatzakis I, Wallace D (2001) Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach. In: Proceedings of the genetic and evolutionary computation conference. ACM Press, New York, pp 1201–1208

  • Karaman A, Uyar S, Eryigit G (2005) The memory indexing evolutionary algorithm for dynamic environments. In: Applications of evolutionary computing. Lecture notes in computer science, vol 3449. Springer, Berlin, pp 563–573

  • Li C, Yang S (2012) A general framework of multipopulation methods with clustering in undetectable dynamic environments. IEEE Trans Evol Comput 99:1

    Google Scholar 

  • McCabe GP, Moore DS (2003) Introduction to the practice of statistics. Freeman and Company, Ohio

  • Michalewicz Z, Schmidt M, Michalewicz M, Chiriac C (2007) Adaptive business intelligence: three case studies. In: Yang S, Ong Y-S, Jin Y (eds) Evolutionary computation in dynamic and uncertain environments. Studies in computational intelligence, vol 51. Springer, Berlin, pp 179–196

  • Nash JC, Walker-Smith M (1987) Nonlinear parameter estimation: an integrated system in BASIC. Marcel Dekker Inc., New York

  • Ng P, Wong KC (1995) A new diploid scheme and dominance change mechanism for nonstationary function optimization. In: Proceedings of the Sixth International Conference on Genetic Algorithms. Morgan Kaufmann, Menlo Park, pp 159–166

  • Nguyen T, Yang S, Branke J (2012) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol Comput 6:1–24

    Article  Google Scholar 

  • Norris JR (1997) Markov chains. In: Cambridge series in statistical and probabilistic mathematics. Cambridge University Press, Cambridge

  • Pan Z, Chen Y, Kan L, Zhang Y (1995) Parameter estimation by genetic algorithms for nonlinear regression. In: Proceedings of the international conference on optimization techniques and applications. World Scientific, Singapore, pp 946–953

  • Richter H, Yang S (2009) Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Comput 13(12):1163–1173

    Article  MATH  Google Scholar 

  • Rohlfshagen P, Yao X (2009) The dynamic knapsack problem revisited: a new benchmark problem for dynamic combinatorial optimization. In: Applications of evolutionary computing. Lecture notes of computer science, vol 5484. Springer, Berlin

  • Rossi C, Abderrahim M, Daz JC (2008) Tracking moving optima using Kalman-based predictions. Evol Comput 16(1):1–30

    Article  Google Scholar 

  • Schmidt M, Michalewicz Z, Michalewicz M, Chiriac C (2005) Prediction and optimization in a dynamic environment: a case study. In: Proceedings of the IEEE congress on evolutionary computation, vol 1. IEEE Press, New York, pp 781–788

  • Simões A, Costa E (2007) Improving memory’s usage in evolutionary algorithms for changing environments. In: Proceedings of the IEEE congress on evolutionary computation. IEEE Press, New York, pp 276–283

  • Simões A, Costa E (2007) Variable-size memory evolutionary algorithm to deal with dynamic environments. In: Applications of evolutionary computing. Lecture notes in computer science, vol 4448. Springer, Berlin, pp 617–626

  • Simões A, Costa E (2008) Evolutionary algorithms for dynamic environments: prediction using linear regression and markov chains. In: Parallel problem solving from nature (PPSN X). Lecture notes on computer science, vol 5199. Springer, Berlin, pp 306–315

  • Simões A, Costa E (2009) Improving prediction in evolutionary algorithms for dynamic environments. In: Proceedings of the genetic and evolutionary computation conference. ACM Press, New York, pp 875–882

  • Simões A, Costa E (2009) Prediction in evolutionary algorithms for dynamic environments using markov chains and nonlinear regression. In: Proceedings of the genetic and evolutionary computation conference. ACM Press, New York, pp 883–890

  • Simões A, Costa E (2012) Virtual loser genetic algorithm for dynamic environments. In: Di Chio C, et al. (eds) Applications of evolutionary computing. Lecture notes on computer science, vol 7248. Springer, Berlin, pp 539–548

  • Stroud PD (2001) Kalman-extended genetic algorithm for search in nonstationary environments with noisy fitness evaluations. IEEE Trans. Evol. Comput. 5(1):66–77

    Article  Google Scholar 

  • Ursem RK (2000) Multimodal optimization techniques in dynamic environments. In: Whitley D et al (eds) Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, Menlo Park, pp 19–26

  • Uyar AS, Harmanci AE (2002) Preserving diversity in changing environments through diploidy with adaptive dominance. In: Langdon WB et al (eds) Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, Menlo Park, p 679

  • Uyar AS, Harmanci AE (2005) A new population based adaptive dominance change mechanism for diploid genetic algorithms in dynamic environments. Soft Comput 9(11):803–814

    Article  MATH  Google Scholar 

  • van Hemert J, Van Hoyweghen C, Lukshandl E, Verbeeck K (2001) A futurist approach to dynamic environments. In: Genetic and evolutionary computation conference, EvoDOP workshop, pp 35–38

  • Weicker K (2003) Evolutionary algorithms and dynamic optimization problems. Der Andere Verlag, Munchen

  • Yang S (2005) Memory-based immigrants for genetic algorithms in dynamic environments. In: Beyer H.-G. (ed) Proceedings of the genetic and evolutionary computation conference, vol 2. ACM Press, New York, pp 1115–1122

  • Yang S.: A comparative study of immune system based genetic algorithms in dynamic environments. In: Proceedings of the genetic and evolutionary computation conference. ACM Press, New York, pp 1377–1384

  • Yang, S (2006) Dominance learning in diploid genetic algorithms for dynamic optimization problems. In: Proceedings of the genetic and evolutionary computation conference. ACM Press, New York, pp 1435–1436

  • Yang S (2007) 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. Studies in computational intelligence, vol 51. Springer, Berlin, pp 3–28

  • Yang S (2008) Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evol Comput 3(16):385–416

    Article  Google Scholar 

  • Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 5(12):542–561

    Article  Google Scholar 

  • Younes A, Basir O, Calamai P (2006) A hybrid evolutionary approach for combinatorial problems in dynamic environments. In: Proceedings of the Canadian conference on electrical and computer engineering. IEEE Press, New York, pp 1595–1600

  • Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E (2007) Prediction-based population re-initialization for evolutionary dynamic multi-objective optimization. In: Evolutionary multi-criterion optimization. Lecture notes in computer science, vol 4403. Springer, Berlin, pp 832–846

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Systems Engineering, Coimbra Institute of Engineering, Polytechnic of Coimbra, Rua Pedro Nunes-Quinta da Nora, 3030-199 , Coimbra, Portugal

    Anabela Simões

  2. Centre for Informatics and Systems, University of Coimbra-Polo II, 3030-290 , Coimbra, Portugal

    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

Corresponding author

Correspondence to Anabela Simões.

Additional information

Communicated by Y.-S. Ong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Simões, A., Costa, E. Prediction in evolutionary algorithms for dynamic environments. Soft Comput 18, 1471–1497 (2014). https://doi.org/10.1007/s00500-013-1154-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-013-1154-z

Keywords

Search

Navigation