Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence
- 6 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Comparison of Multiobjective Evolutionary Algorithms: Empirical ResultsEvolutionary Computation, 2000
- A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-IILecture Notes in Computer Science, 2000
- The Pareto Envelope-Based Selection Algorithm for Multiobjective OptimizationLecture Notes in Computer Science, 2000
- Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test ProblemsEvolutionary Computation, 1999
- Muiltiobjective Optimization Using Nondominated Sorting in Genetic AlgorithmsEvolutionary Computation, 1994