Skip to main content

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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

  • Dowsland, K. A. (1996) Genetic algorithms — A tool for OR?, Journal of the Operational Research Society, Vol. 47, 550–561

    MATH  Google Scholar 

  • Drexl, A. (1991) Scheduling of project networks by job assignment, Management Science, Vol. 37, 1590–1602

    Article  MATH  Google Scholar 

  • Goldberg, D. E. (1989) Genetic algorithms in search, optimization, and machine learning, Reading/Massachusetts et al.

    Google Scholar 

  • Holland, J. H. (1975) Adaptation in natural and artificial intelligence, Ann Arbor

    Google Scholar 

  • Michalewicz, Z. (2000) Genetic algorithms + data structures = Evolution programs, 3rd ed., Berlin et al.

    Google Scholar 

  • Reeves, C. R. (Ed.) (1993) Modern heuristic techniques for combinatorial problems, Oxford et al.

    Google Scholar 

  • Reeves, C.R. (1997) Genetic algorithms for the operations researcher, INFORMS Journal on Computing, Vol. 9, 231–250

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Berlin · Heidelberg

About this chapter

Cite this chapter

Klein, R. (2005). Genetic Algorithms. In: Stadtler, H., Kilger, C. (eds) Supply Chain Management and Advanced Planning. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-24814-5_29

Download citation

Publish with us

Policies and ethics