Referenced Items are not available for this document.
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
Published in:
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on
(Volume:1
)
Date of Conference: 1999
- Meeting Date :
- 06 Jul 1999-09 Jul 1999
- Print ISBN:
- 0-7803-5536-9
- INSPEC Accession Number:
- 6346969
- Conference Location :
- Washington, DC
- Digital Object Identifier :
- 10.1109/CEC.1999.782014
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
