1999 | OriginalPaper | Buchkapitel
Single-Mode Genetic Algorithms
verfasst von : Dr. Sönke Hartmann
Erschienen in: Project Scheduling under Limited Resources
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this chapter, we discuss genetic algorithm (GA) heuristics for the RCPSP. The GAs make use of many of the concepts that were discussed in the previous chapter, such as schedule generation schemes, problem representations, and priority rule methods. We will also introduce some new approaches such as new operators, generalized representations, and a local search extension. In particular, we will introduce a representation which allows the GA to adapt itself by learning which algorithmic component should be used.