DocumentCode :
342669
Title :
A case study of a multiobjective recombinative genetic algorithm with coevolutionary sharing
Author :
Neef, M. ; Thierens, Dirk ; Arciszewski, Henryk
Author_Institution :
Cognitive Artificial Intelligence, Utrecht Univ., Netherlands
Volume :
1
fYear :
1999
fDate :
1999
Abstract :
We present a multiobjective genetic algorithm that incorporates various genetic algorithm techniques that have been proven to be efficient and robust in their problem domain. More specifically, we integrate rank based selection, adaptive niching through coevolutionary sharing, elitist recombination, and non-dominated sorting into a multiobjective genetic algorithm called ERMOCS. As a proof of concept we test the algorithm on a softkill-scheduling problem
Keywords :
algorithm theory; genetic algorithms; scheduling; ERMOCS; adaptive niching; coevolutionary sharing; elitist recombination; genetic algorithm techniques; multiobjective recombinative genetic algorithm; nondominated sorting; rank based selection; softkill-scheduling problem; Artificial intelligence; Computational modeling; Computer aided software engineering; Computer science; Computer simulation; Genetic algorithms; Laboratories; Physics; Spontaneous emission; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-5536-9
Type :
conf
DOI :
10.1109/CEC.1999.782014
Filename :
782014
Link To Document :
بازگشت