Abstract

In this paper, we first explain why many-objective problems are difficult for Pareto dominance-based evolutionary multiobjective optimization algorithms such as NSGA-II and SPEA. Then we explain recent proposals for the handling of many-objective problems by evolutionary algorithms. Some proposals are examined through computational experiments on multiobjective knapsack problems with two, four and six objectives. Finally we discuss the viability of many-objective genetic fuzzy systems (i.e., the use of many-objective genetic algorithms for the design of fuzzy rule-based systems).

Keywords:
Knapsack problem Multi-objective optimization Evolutionary algorithm Computer science Mathematical optimization Pareto principle Fuzzy logic Evolutionary computation Genetic algorithm Continuous knapsack problem Optimization problem Artificial intelligence Mathematics Machine learning

Metrics

148
Cited By
2.73
FWCI (Field Weighted Citation Impact)
44
Refs
0.92
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Multi-Objective Optimization Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Evolutionary Algorithms and Applications
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Evolutionary many-objective optimization

Hisao IshibuchiHiroyuki Satō

Journal:   Proceedings of the Genetic and Evolutionary Computation Conference Companion Year: 2019 Pages: 614-661
BOOK-CHAPTER

Evolutionary algorithm for many-objective optimization

Hua XuYuan Yuan

Elsevier eBooks Year: 2024 Pages: 1-1
BOOK-CHAPTER

Surrogate-Assisted Many-Objective Evolutionary Optimization

Yaochu JinHanding WangChaoli Sun

Studies in computational intelligence Year: 2021 Pages: 231-271
© 2026 ScienceGate Book Chapters — All rights reserved.