Skip to main content
SpringerLink
Log in
Book cover

Advances in Evolutionary Computing pp 239–262Cite as

Designing Evolutionary Algorithms for Dynamic Optimization Problems

  • Chapter

Part of the book series: Natural Computing Series ((NCS))

Abstract

Most research in evolutionary computation focuses on optimization of static, non-changing problems. Many real-world optimization problems, however, are dynamic, and optimization methods are needed that are capable of continuously adapting the solution to a changing environment. If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. In this chapter, we suggest a classification of dynamic optimization problems, and survey and classify a number of the most widespread techniques that have been published in the literature so far to make evolutionary algorithms suitable for changing optimization problems. After this introduction to the basics, we will discuss in more detail two specific approaches, pointing out their deficiencies and potential. The first approach is based on memorization, the other one uses a novel multi-population structure.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Raman, N., Talbot, F. B. (1993) The job shop tardiness problem: a decomposition approach. European Journal of Operational Research, 69, 187–199

    Article  MATH  Google Scholar 

  2. Branke, J. (2002) Evolutionary optimization in dynamic environments. Kluwer.

    Google Scholar 

  3. Branke, J. (1999) Evolutionary algorithms for dynamic optimization problems — a survey. Technical Report 387, Insitute AIFB, University of Karlsruhe

    Google Scholar 

  4. Cobb, H. G. (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, DC

    Google Scholar 

  5. Vavak, F., Jukes, K., Fogarty, T. C. (1997) Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search. In Back [47], 719–726

    Google Scholar 

  6. Vavak, F., Jukes, K., Fogarty, T.C. (1997) Learning the local search range for genetic optimisation in nonstationary environments. In IEEE International Conference on Evolutionary Computation ICEC’97, 355–360. IEEE

    Google Scholar 

  7. Bierwirth, C., Kopfer, H. (1994) Dynamic task scheduling with genetic algorithms in manufacturing systems. Technical Report, Department of Economics, University of Bremen

    Google Scholar 

  8. Bierwirth, C., Mattfeld, D. C. (1999) Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7, 1–18

    Article  Google Scholar 

  9. Lin, S.C., Goodman, E.D., Punch, W.F. (1997) A genetic algorithm approach to dynamic job shop scheduling problems. In Bäck [47], 481–488

    Google Scholar 

  10. Mattfeld, D.C., Bierwirth, C. (1998) Minimizing job tardiness: Priority rules vs. adaptive scheduling. In I. C. Parmee, editor, Proceedings of ACDM, 59–67. Springer

    Google Scholar 

  11. Reeves, C., Karatza, H. Dynamic sequencing of a multi-processor system: A genetic algorithm approach. In R. F. Albrecht, C. R. Reeves, and N. C. Steele, editors, Artificial Neural Nets and Genetic Algorithms, 491–495. Springer

    Google Scholar 

  12. Eiben, A. E., Hinterding, R., Michalewicz, Z. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3, 124–141

    Google Scholar 

  13. Angeline, P. J. (1997) Tracking extrema in dynamic environments. In Angeline et al. [48], 335–345

    Google Scholar 

  14. Bäck, T. (1998) On the behavior of evolutionary algorithms in dynamic environments. In IEEE International Conference on Evolutionary Computation, 446–451. IEEE

    Google Scholar 

  15. Grefenstette, J. J. (1999) Evolvability in dynamic fitness landscapes: A genetic algorithm approach. In Congress on Evolutionary Computation, 3, 2031–2038. IEEE

    Google Scholar 

  16. Stephens, C.R., Olmedo, I.G., Vargas, J.M., Waelbroeck, H. (1998) Self-adaptation in evolvins systems. Artificial Life, 4

    Google Scholar 

  17. Weicker, K., Weicker, N. (1999) On evolution strategy optimization in dynamic environments. In Congress on Evolutionary Computation, 3, 2039–2046

    Google Scholar 

  18. Grefenstette, J. J. (1992) Genetic algorithms for changing environments. In R. Maenner and B. Manderick, editors, Parallel Problem Solving from Nature 2, 137–144. North-Holland

    Google Scholar 

  19. Andersen, H. C. (1991) An investigation into genetic algorithms, and the relationship between speciation and the tracking of optima in dynamic functions. Honours thesis, Queensland University of Technology, Brisbane

    Google Scholar 

  20. Liles, W., DeJong, K. (1999) The usefulness of tag bits in changing environments. In Congress on Evolutionary Computation, 3, 2054–2060. IEEE

    Google Scholar 

  21. Spears, W. (1994) Simple subpopulation schemes. In Evolutionary Programming Conference, 296–307. World Scientific

    Google Scholar 

  22. Cedeno, W., Vemuri, V. R. On the use of niching for dynamic landscapes. In International Conference on Evolutionary Computation. IEEE

    Google Scholar 

  23. Ghosh, A., Tsutsui, S., Tanaka, H. (1998) Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals. In IEEE International Conference on Evolutionary Computation 666–671

    Google Scholar 

  24. Mori, N., Kita, H., Nishikawa, Y. (1996) Adaptation to a changing environment by means of the thermodynamical genetic algorithm. In H.-M. Voigt, editor, Parallel Problem Solving from Nature, 1141 LNCS, 513–522. Springer

    Google Scholar 

  25. Mori, N., Kita, H., Nishikawa, Y. (1998) Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm. In Eiben et al. [49], 149–158

    Google Scholar 

  26. Oppacher, F., Wineberg, M. (1999) The shifting balance genetic algorithm: Improving the ga in a dynamic environment. In W. Banzhalf et al., (ed.)Genetic and Evolutionary Computation Conference,1, 504–510. Morgan Kaufmann

    Google Scholar 

  27. Sarma, J., DeJong, K. (1999) The behavior of spatially distributed evolutionary algorithms in non-stationary environments. In Wolfgang Banzhaf et al., editor GECCO, 1, 572–578, Morgan Kaufmann, San Francisco, California

    Google Scholar 

  28. Goldberg, D.E., Smith, R.E. (1987) Nonstationary function optimization using genetic algorithms with dominance and diploidy. In J. J. Grefenstette, editor, Second International Conference on Genetic Algorithms, 59–68. Lawrence Erlbaum Associates

    Google Scholar 

  29. Hadad, B. S., Eick, C.F. (1997) Supporting polyploidy in genetic algorithms using dominance vectors. In et al. [48], 223–234

    Google Scholar 

  30. Ng, K. P., Wong, K. C. (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimization. In Sixth International Conference on Genetic Algorithms, 159–166. Morgan Kaufmann

    Google Scholar 

  31. Smith, R. E. (1987) Diploid genetic algorithms for search in time varying environments. In Annual Southeast Regional Conference of the ACM, 175–179, New York

    Google Scholar 

  32. Ryan, C. (1997) Diploidy without dominance. In J. T. Alander, editor, Third Nordic Workshop on Genetic Algorithms, 63–70

    Google Scholar 

  33. Lewis, J., Hart, E., Ritchie, G. A comparison of dominance mechanisms and simple mutation on non-stationary problems. In Eiben et al. [49],139–148

    Google Scholar 

  34. Dasgupta, D., McGregor, D. R. (1992) Nonstationary function optimization using the structured genetic algorithm. In R. Männer and B. Manderick, (eds.), Parallel Problem Solving from Nature, 145–154. Elsevier Science Publisher

    Google Scholar 

  35. Dasgupta, D. (1995) Incorporating redudancy and gene activation mechanisms in genetic search. In L. Chambers, (ed.), Practical Handbook of Genetic Algorithms, 2, 303–316. CRC Press

    Google Scholar 

  36. Louis, S. J., Xu, Z. (1996) Genetic algorithms for open shop scheduling and re-scheduling. In M. E. Cohen and D.L. Hudson, editors, ISCA Eleventh International Conference on Computers and their Applications, 99–102

    Google Scholar 

  37. Louis, S.J, Johnson, J. (1997) Solving similar problems using genetic algorithms and case-based memory. In Bäck [47], 283–290

    Google Scholar 

  38. Ramsey, C.L., Grefenstette, J. J. (1993) Case-based initialization of genetic algorithms. In S. Forrest, editor, Fifth International Conference on Genetic Algorithms, 84–91. Morgan Kaufmann

    Google Scholar 

  39. Trojanowski, K., Michalewicz, Z., Xiao, J. (1997) Adding memory to the evolutionary planner/navigator. In IEEE Intl. Conference on Evolutionary Computation, 483–487

    Google Scholar 

  40. Trojanowski, K., Michalewicz, Z. (1999) Searching for optima in non-stationary environments. In Congress on Evolutionary Computation, 3, 1843–1850. IEEE

    Google Scholar 

  41. Branke, J. (1999) Memory enhanced evolutionary algorithms for changing optimization problems. In Congress on Evolutionary Computation CEC99, 3, 1875–1882. IEEE

    Google Scholar 

  42. Mori, N., Imanishi, S., Kita, H., Nishikawa, Y. (1997) Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm. In Bäck [47], 299–306

    Google Scholar 

  43. Morrison, R. W., DeJong, K. A. (1999) A test problem generator for non-stationary environments. In Congress on Evolutionary Computation, 3, 2047–2053. IEEE

    Google Scholar 

  44. DeJong, K. (1975) An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor MI

    Google Scholar 

  45. Tstutsui, S., Fujimoto, Y., Ghosh, A. (1997) Forking genetic algorithms: Gas with search space division schemes. Evolutionary Computation, 5, 61–80

    Article  Google Scholar 

  46. Branke, J., Kaußler, T., Schmidt, C., Schmeck, H. (2000) A multi-population approach to dynamic optimization problems. In Adaptive Computing in Design and Manufacturing 2000, 299–308. Springer

    Google Scholar 

  47. Bäck, T. (ed.) (1997) Seventh International Conference on Genetic Algorithms. Morgan Kaufmann

    Google Scholar 

  48. Angeline, P.J., Reynolds R.G, McDonnell, J.R., Eberhart, R.(eds.) (1997) Proceedings of the Sixth International Conference on Evolutionary Programming, 1213 LNCS. Springer

    Google Scholar 

  49. Eiben, A.E., Back T., Schoenauer, M., Schwefel, H. P.(eds.) (1998) Parallel Problem Solving from Nature, number 1498 in LNCS. Springer

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute AIFB, University of Karlsruhe, D-76128, Karlsruhe, Germany

    Jürgen Branke & Hartmut Schmeck

Authors
  1. Jürgen Branke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hartmut Schmeck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata, 700 035, India

    Ashish Ghosh

  2. Department of Management Information, Hannan University, 5-4-33 Amamhigigashi, Matsubara, Osaka, 580-8502, Japan

    Shigeyoshi Tsutsui

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Branke, J., Schmeck, H. (2003). Designing Evolutionary Algorithms for Dynamic Optimization Problems. In: Ghosh, A., Tsutsui, S. (eds) Advances in Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18965-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18965-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62386-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation