Title
A case study of a multiobjective recombinative genetic algorithm with coevolutionary sharing
Author
Neef, R.M.
Thierens, D.
Arciszewski, H.F.R.
TNO Fysisch en Elektronisch Laboratorium
Publication year
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
Subject
ERMOCS
Adaptive niching
Coevolutionary sharing
Elitist recombination
Genetic algorithm techniques
Multiobjective recombinative genetic algorithm
Nondominated sorting
Rank based selection
Ssoftkill-scheduling problem
To reference this document use:
http://resolver.tudelft.nl/uuid:03b2e604-a567-469b-a64f-a1aa6a28d4a8
DOI
https://doi.org/10.1109/cec.1999.782014
TNO identifier
471560
Source
Proceedings of the 1999 Congress on Evolutionary Computation 1999, CEC 99, 6-9 July 1999, Washington, DC, 796-803
Document type
conference paper