Genetic Algorithms

Robert Klein
Additional contact information
Robert Klein: University of Augsburg

Chapter 30 in Supply Chain Management and Advanced Planning, 2008, pp 529-536 from Springer

Abstract: Abstract Many optimization problems of the type arising in scheduling and routing (see Chaps. 10 and 12) are of combinatorial nature, i. e. solutions are obtained by combining and sequencing solution elements. When solving such problems to optimality, the number of solutions to be examined exponentially grows with the problem size. For example, for n solution elements n! different sequences exist.

Keywords: Genetic Algorithm; Gene Pool; Combinatorial Optimization Problem; Infeasible Solution; Roulette Wheel (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-74512-9_31

Ordering information: This item can be ordered from
http://www.springer.com/9783540745129

DOI: 10.1007/978-3-540-74512-9_31

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).