Abstract
This study explores the utility of multiobjective evolutionary algorithms (using standard Pareto ranking and diversity-promoting selection mechanisms) for solving optimization tasks with many conflicting objectives. Optimizer behavior is assessed for a grid of mutation and recombination operator configurations. Performance maps are obtained for the dual aims of proximity to, and distribution across, the optimal tradeoff surface. Performance sweet-spots for both variation operators are observed to contract as the number of objectives is increased. Classical settings for recombination are shown to be suitable for small numbers of objectives but correspond to very poor performance for higher numbers of objectives, even when large population sizes are used. Explanations for this behavior are offered via the concepts of dominance resistance and active diversity promotion.
Keywords
Mathematical optimizationMulti-objective optimizationEvolutionary algorithmSelection (genetic algorithm)Ranking (information retrieval)Computer sciencePopulationEvolutionary computationPareto principleOptimization problemOperator (biology)Dual (grammatical number)MathematicsArtificial intelligenceBiology
Affiliated Institutions
Related Publications
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (wher...
A niched Pareto genetic algorithm for multiobjective optimization
Many, if not most, optimization problems have multiple objectives. Historically, multiple objectives have been combined ad hoc to form a scalar objective function, usually throu...
An Overview of Evolutionary Algorithms in Multiobjective Optimization
The application of evolutionary algorithms (EAs) in multiobjective optimization is currently receiving growing interest from researchers with various backgrounds. Most research ...
Rank-density-based multiobjective genetic algorithm and benchmark test function study
Concerns the use of evolutionary algorithms (EA) in solving multiobjective optimization problems (MOP). We propose the use of a rank-density-based genetic algorithm (RDGA) that ...
Smart Pareto filter: obtaining a minimal representation of multiobjective design space
Multiobjective optimization is a powerful tool for resolving conflicting objectives in engineering design and numerous other fields. One general approach to solving multiobjecti...
Publication Info
- Year
- 2007
- Type
- article
- Volume
- 11
- Issue
- 6
- Pages
- 770-784
- Citations
- 445
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
445
OpenAlex
Cite This
Robin C. Purshouse,
P.J. Fleming
(2007).
On the Evolutionary Optimization of Many Conflicting Objectives.
IEEE Transactions on Evolutionary Computation
, 11
(6)
, 770-784.
https://doi.org/10.1109/tevc.2007.910138
Identifiers
- DOI
- 10.1109/tevc.2007.910138