Repository hosted by TU Delft Library

Home · Contact · About · Disclaimer ·
 

A Case Study of a Multiobjective Elitist Recombinative Genetic Algorithm with Coevolutionary Sharing

Author: Neef, R.M. · Thierens, D. · Arciszewski, H.F.R.
Type:report
Date:1999
Publisher: Universiteit van Utrecht
Place: Utrecht
Identifier: 471561
Report number: UU-CS-TR-1999-49
Keywords: Genetic algorithms · Multiobjective optimisation · Coevolutionary sharing · Softkill scheduling

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