Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147594
Authors: 
Hartmann, Sönke
Year of Publication: 
1999
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 506
Abstract: 
This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the best alternative (e.g., the best crossover strategy) a priori. For such cases, we suggest to include alternative components into the genetic algorithm. Indicating the component to be actually used in the genotype, this allows the genetic algorithm to adapt itself. That is, the genetic algorithm learns which of the alternative components is the most successful by means of genetic optimization. In order to demonstrate the potential of the self-adapting genetic algorithm concept, we apply it to the classical resource-constrained project scheduling problem (RCPSP). Motivated by previous computational studies as well as theoretical insight, we employ two different decoding procedures and leave the decision which of them to select to the evolution. The approach is further enhanced by a problem-specific local search extension. An in-depth computational experimental analysis shows that the self-adapting genetic algorithm approach is currently the most promising heuristic for the RCPSP.
Subjects: 
Genetic Algorithm
Self-Adaptation
Local Search
Project Scheduling
Computational Results
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.