Repository hosted by TU Delft Library

Home · Contact · About · Disclaimer ·

A case study of a multiobjective recombinative genetic algorithm with coevolutionary sharing

Publication files not online:

Author: Neef, R.M. · Thierens, D. · Arciszewski, H.F.R.
Institution: TNO Fysisch en Elektronisch Laboratorium
Source:Proceedings of the 1999 Congress on Evolutionary Computation 1999, CEC 99, 6-9 July 1999, Washington, DC, 796-803
Identifier: 471560
doi: doi:0.1109/CEC.1999.782014
Keywords: ERMOCS · Adaptive niching · Coevolutionary sharing · Elitist recombination · Genetic algorithm techniques · Multiobjective recombinative genetic algorithm · Nondominated sorting · Rank based selection · Ssoftkill-scheduling problem


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