Genetic Algorithms

Robert Klein () and Oliver Faust ()
Additional contact information
Robert Klein: Universitätsstraße 16
Oliver Faust: Universitätsstraße 16

Chapter 31 in Supply Chain Management and Advanced Planning, 2015, pp 537-544 from Springer

Abstract: Abstract Many optimization problems Optimization problem 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; Memetic Algorithm; Local Search Algorithm; Roulette Wheel (search for similar items in EconPapers)
Date: 2015
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:sptchp:978-3-642-55309-7_31

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

DOI: 10.1007/978-3-642-55309-7_31

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().