Single-Mode Genetic Algorithms
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.
KeywordsGenetic Algorithm Local Search Crossover Operator Priority Rule Activity List
Unable to display preview. Download preview PDF.