Constrained Test Problems for Multi-objective Evolutionary Optimization

@inproceedings{Deb2001ConstrainedTP,
  title={Constrained Test Problems for Multi-objective Evolutionary Optimization},
  author={Kalyanmoy Deb and Amrit Pratap and T. Meyarivan},
  booktitle={EMO},
  year={2001}
}
Over the past few years, researchers have developed a number of multi-objective evolutionary algorithms (MOEAs). Although most studies concentrated on solving unconstrained optimization problems, there exists a few studies where MOEAs have been extended to solve constrained optimization problems. As the constraint handling MOEAs gets popular, there is a need for developing test problems which can evaluate the algorithms well. In this paper, we review a number of test problems used in the… Expand
A Tunable Constrained Test Problems Generator for Multi-objective Optimization
  • Peng Cheng
  • Mathematics
  • 2008 Second International Conference on Genetic and Evolutionary Computing
  • 2008
Multi-objective optimization problems (MOPs) in real world are often constrained optimization problems. So test problems to evaluate multi-objective optimization evolutionary algorithms (MOEAs)Expand
A comparative study of constraint-handling techniques in evolutionary constrained multiobjective optimization
TLDR
This paper first constructs 18 test instances, each of which exhibits different properties, and chooses three representative constraint-handling techniques and combines them with nondominated sorting genetic algorithm II to study the performance difference on various conditions. Expand
Scalable test problems for evolutionary multi-objective optimization
TLDR
Three different approaches for systematically designing test problems for systematically demonstrating the efficacy of multi-objective evolutionary algorithms in handling problems having more than two objectives are suggested. Expand
BSTBGA: A hybrid genetic algorithm for constrained multi-objective optimization problems
  • Xiang Li, Gang Du
  • Mathematics, Computer Science
  • Comput. Oper. Res.
  • 2013
TLDR
Numerical experiments indicate that the proposed hybrid genetic algorithm to solve constrained multi-objective optimization problems (CMOPs) can clearly simulate the Pareto front for the problems under consideration. Expand
Scalable Test Problems for Evolutionary Multiobjective Optimization
TLDR
Three different approaches for systematically designing test problems for systematically demonstrating the efficacy of multiobjective evolutionary algorithms in handling problems having more than two objectives are suggested. Expand
On Test Functions for Evolutionary Multi-objective Optimization
TLDR
This paper presents a straightforward way to define benchmark problems with an arbitrary Pareto front both in the fitness and parameter spaces and introduces a difficulty measure based on the mapping of probability density functions from parameter to fitness space. Expand
A New Hybrid Evolutionary Algorithm for the Treatment of Equality Constrained MOPs
TLDR
This paper proposes three new problems with different characteristics that are indeed hard to solve by evolutionary algorithms and develops a variant of NSGA-II with a continuation method that is highly competitive to state-of-the-art evolutionary algorithms. Expand
Constraint handling within MOEA/D through an additional scalarizing function
TLDR
A novel selection mechanism inspired by the ε-constraint method is introduced, which builds a bi-objective problem considering the scalarizing function used into the decomposition approach of MOEA/D and the constraint violation degree as an objective function. Expand
Evolutionary Constrained Multiobjective Optimization: Test Suite Construction and Performance Comparisons
TLDR
This paper proposes a new constraint construction method to facilitate the systematic design of test problems and designs a new test suite consisting of 14 instances, which covers diverse characteristics extracted from real-world CMOPs and can be divided into four types. Expand
Multi-objective Optimization with Dynamic Constraints and Objectives: New Challenges for Evolutionary Algorithms
TLDR
A new version of the Dynamic Non dominated Sorting Genetic Algorithm II is proposed to deal with dynamic constraints by replacing the used constraint-handling mechanism by a more elaborated and self-adaptive penalty function. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
  • K. Deb
  • Mathematics, Computer Science
  • Evolutionary Computation
  • 1999
TLDR
The problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging to the true Pareto-optimal front are studied to enable researchers to test their algorithms for specific aspects of multi- objective optimization. Expand
Evolutionary algorithms for multiobjective optimization: methods and applications
TLDR
The basic principles of evolutionary multiobjective optimization are discussed from an algorithm design perspective and the focus is on the major issues such as fitness assignment, diversity preservation, and elitism in general rather than on particular algorithms. Expand
MULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM
Abstract This paper presents an evolutionary algorithm for generic multiobjective design optimization problems. The algorithm is based on nondominance of solutions in the objective and constraintExpand
Constrained Multiobjective Optimization by Evolutionary Algorithms
An evolutionary computation technique for constrained multiobjective optimization problems is proposed in this paper. A Nondominated Sorting Evolutionary Algorithm is used to nd a number ofExpand
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
TLDR
Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously are investigated and suggested to be extended to higher dimensional and more difficult multiobjective problems. Expand
A niched Pareto genetic algorithm for multiobjective optimization
TLDR
The Niched Pareto GA is introduced as an algorithm for finding the Pare to optimal set and its ability to find and maintain a diverse "Pareto optimal population" on two artificial problems and an open problem in hydrosystems is demonstrated. Expand
A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm
Genetic algorithms (GAs), which are directed stochastic hill climbing algorithms, are a commonly used optimization technique and are generally applied to single criterion optimization problems withExpand
Mechanical Component Design for Multiple Objectives Using Elitist Non-dominated Sorting GA
TLDR
It is shown that the elitist NSGA-II can find a much wider spread of solutions than classical methods and the NSGA, and suggests immediate application of the proposed method to other more complex engineering design problems. Expand
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
TLDR
A rank-based fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs) and the genetic algorithm is seen as the optimizing element of a multiobjective optimization loop, which also comprises the DM. Expand
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
TLDR
Simulation results on five difficult test problems show that the proposed NSGA-II, in most problems, is able to find much better spread of solutions and better convergence near the true Pareto-optimal front compared to PAES and SPEA--two other elitist multi-objective EAs which pay special attention towards creating a diverse Paretimal front. Expand
...
1
2
3
...