A Case Study of a Multiobjective Elitist Recombinative Genetic Algorithm with Coevolutionary Sharing
report
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
TNO Identifier
471561
Publisher
Universiteit van Utrecht
Collation
12 p.
Place of publication
Utrecht