articleIEEE Transactions on Evolutionary ComputationSep 16, 2013Closed access

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints

Michigan State University · Indian Institute of Technology Delhi

Indexed incrossref

Abstract

Having developed multiobjective optimization algorithms using evolutionary optimization methods and demonstrated their niche on various practical problems involving mostly two and three objectives, there is now a growing need for developing evolutionary multiobjective optimization (EMO) algorithms for handling many-objective (having four or more objectives) optimization problems. In this paper, we recognize a few recent efforts and discuss a number of viable directions for developing a potential EMO algorithm for solving many-objective optimization problems. Thereafter, we suggest a reference-point-based many-objective evolutionary algorithm following NSGA-II framework (we call it NSGA-III) that emphasizes…

Citation impact

6,670
total citations
FWCI
132.57
Percentile
100%
References
67
Citations per year

Authors

2

Topics & keywords

Keywords
  • Sorting
  • Multi-objective optimization
  • Evolutionary algorithm
  • Mathematical optimization
  • Optimization problem
  • Set (abstract data type)
  • Computer science
  • Evolutionary computation
UN Sustainable Development Goals
  • Partnerships for the goals
No related works found for this paper.