articleIEEE Transactions on Evolutionary ComputationSep 11, 2013Closed access

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach

Indian Institute of Technology Delhi · Michigan State University

Indexed incrossref

Abstract

In the precursor paper, a many-objective optimization method (NSGA-III), based on the NSGA-II framework, was suggested and applied to a number of unconstrained test and practical problems with box constraints alone. In this paper, we extend NSGA-III to solve generic constrained many-objective optimization problems. In the process, we also suggest three types of constrained test problems that are scalable to any number of objectives and provide different types of challenges to a many-objective optimizer. A previously suggested MOEA/D algorithm is also extended to solve constrained problems. Results using constrained NSGA-III and constrained MOEA/D show an edge of the former, particularly in solving problems…

Citation impact

2,055
total citations
FWCI
39.47
Percentile
100%
References
33
Citations per year

Authors

2

Topics & keywords

Keywords
  • Sorting
  • Mathematical optimization
  • Multi-objective optimization
  • Evolutionary algorithm
  • Optimization problem
  • Computer science
  • Scalability
  • Mathematics
No related works found for this paper.

Funding