The Naive ${\mathbb M}$ ID ${\mathbb E}$ A: A Baseline Multi–objective EA
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 428-442
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The balance between proximity and diversity in multiobjective evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2003
- Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithmsInternational Journal of Approximate Reasoning, 2002
- Constrained Test Problems for Multi-objective Evolutionary Optimization2001
- Comparison of Multiobjective Evolutionary Algorithms: Empirical ResultsEvolutionary Computation, 2000
- A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II2000
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Polygenic inheritance — A haploid scheme that can outperform diploidy1998
- An Overview of Evolutionary Algorithms in Multiobjective OptimizationEvolutionary Computation, 1995