• Publications
  • Influence
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints
  • K. Deb, Himanshu Jain
  • Mathematics, Computer Science
  • IEEE Transactions on Evolutionary Computation
  • 1 August 2014
We propose a reference-point-based many-objective evolutionary algorithm following NSGA-II framework (we call it NS GA-III) that emphasizes population members that are nondominated, yet close to a set of supplied reference points. Expand
  • 2,075
  • 466
  • PDF
Scalable Test Problems for Evolutionary Multiobjective Optimization
In this study, we have suggested three different approaches for systematically designing test problems for this purpose. Expand
  • 1,421
  • 250
  • PDF
Optimization for Engineering Design: Algorithms and Examples
  • 1,035
  • 57
Searching for Robust Pareto-Optimal Solutions in Multi-objective Optimization
In optimization studies including multi-objective optimization, the main focus is usually placed in finding the global optimum or global Pareto-optimal frontier, representing the best possible objective values. Expand
  • 195
  • 24
Multiobjective Optimization
Interactive Multiobjective Optimization Using a Set of Additive Value Functions and Dominance-Based Rough Set Approach. Expand
  • 454
  • 16
  • PDF
Scalable test problems for evolutionary multi-objective optimization
We propose three different approaches for systematically designing test problems for this purpose. Expand
  • 144
  • 14
Real-coded evolutionary algorithms with parent-centric recombination
We propose a generic parent-centric recombination operator (PCX) and compare its performance with a couple of commonly-used mean-focused recombination operators (UNDX and SPX). Expand
  • 95
  • 13
  • PDF
Implicit Niching in a Learning Classifier System: Nature's Way
We approach the difficult task of analyzing the complex behavior of even the simplest learning classifier system (LCS) by isolating one crucial subfunction in the LCS learning algorithm: covering through niching. Expand
  • 155
  • 6
An evolutionary algorithm for constrained multi-objective optimization
The paper follows the line of the design and evaluation of new evolutionary algorithms for constrained multi-objective optimization with a constraint handling technique and a diversity mechanism to obtain multiple nondominated solutions through the simple run of the algorithm. Expand
  • 74
  • 5
Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping
We introduce bilevel evolutionary algorithm based on quadratic approximations (BLEAQ) of optimal lower level variables with respect to the upper level variables. Expand
  • 43
  • 4