A case study of a multiobjective recombinative genetic algorithm with coevolutionary sharing
conference paper
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
Topics
TNO Identifier
471560
Source title
Proceedings of the 1999 Congress on Evolutionary Computation 1999, CEC 99, 6-9 July 1999, Washington, DC
Pages
796-803
Files
To receive the publication files, please send an e-mail request to TNO Repository.