• Corpus ID: 18585705

Evolutionary Computation and Convergence to a Pareto Front

@inproceedings{Veldhuizen1998EvolutionaryCA,
  title={Evolutionary Computation and Convergence to a Pareto Front},
  author={David A. van Veldhuizen},
  year={1998}
}
Research into solving multiobjective optimization problems (MOP) has as one of its an overall goals that of developing and defining foundations of an Evolutionary Computation (EC)-based MOP theory. [] Key Result We conclude by using this work to justify further exploration into the theoretical foundations of EC-based MOP solution methods.

Figures and Tables from this paper

Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
TLDR
This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search.
On measuring multiobjective evolutionary algorithm performance
TLDR
The intent is to rigorously define and execute a quantitative MOEA performance comparison methodology and selected results from its execution with four MOEAs give a basis for absolute conclusions regardingMOEA performance.
Multiobjective optimization with messy genetic algorithms
TLDR
An innovative extension of the building block-based messy genetic algorithm (called the MOMGA) is presented and applied successfully to the MOP test suite and is shown to be quite effective when compared to other contemporary MOEAs.
Scored Pareto MEC for Multi-Objective Optimization and Its Convergence
TLDR
A new evolutionary optimization algorithm, which embeds the theory of Pareto and information of density into the Mind Evolutionary Computation in order to deal with multi-objective optimization problems, and can achieve the high-quality trade-off front for multi- objective optimization.
Multiobjective evolutionary algorithm test suites
TLDR
This paper provides several Multiobjective Optimization Problems (MOPS) for use as part of a standardized MOEA test suite, and proposes a methodology whereby various MOEAs can be directly compared.
Research on performance measures of multi-objective optimization evolutionary algorithms
  • Z. Lili, Zeng Wenhua
  • Computer Science
    2008 3rd International Conference on Intelligent System and Knowledge Engineering
  • 2008
TLDR
Two new performance measures computing the convergence towards the Pareto front and the solution diversity on the PAREto front are proposed and an outlook on how to further deepen insight in performance measures of MOEAs is given.
Various selection approaches on evolutionary multiobjective optimization
  • Chengwang Xie, L. Ding
  • Computer Science
    2010 3rd International Conference on Biomedical Engineering and Informatics
  • 2010
TLDR
The paper proves the convergence of MOEAs with certain features, and the process of proof has shown that it is reasonable to regard Pknown achieved from the final results ofMOEAs as Ptrue or the approximated Pareto optimal set.
Entropy-Based Termination Criterion for Multiobjective Evolutionary Algorithms
TLDR
A novel entropy-based dissimilarity measure is proposed that helps identify on the fly the number of generations beyond which an algorithm stabilizes, implying that either a good approximation has been obtained or that it cannot be obtained due to the stagnation of the algorithm in the search space.
An Entropy-Based Multiobjective Evolutionary Algorithm with an Enhanced Elite Mechanism
TLDR
An entropy-based multi-objective evolutionary algorithm with an enhanced elite mechanism (E-MOEA), which improves the convergence and diversity of solution set in MOPs effectively and accelerates the population to approach the true Pareto front at the early stage of the evolution process.
...
...

References

SHOWING 1-10 OF 14 REFERENCES
On a multi-objective evolutionary algorithm and its convergence to the Pareto set
  • G. Rudolph
  • Computer Science
    1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)
  • 1998
TLDR
It is shown that results known from the theory of evolutionary algorithms in case of single-criterion optimization do not carry over to the multi-criteria case, and a theoretical analysis shows that a special version of an evolutionary algorithm with this step size rule converges with probability one to the Pareto set for the test problem under consideration.
An Overview of Evolutionary Algorithms in Multiobjective Optimization
TLDR
Current multiobjective evolutionary approaches are discussed, ranging from the conventional analytical aggregation of the different objectives into a single function to a number of population-based approaches and the more recent ranking schemes based on the definition of Pareto optimality.
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.
Multiobjective genetic algorithms with application to control engineering problems.
TLDR
This work reinterpreted multiobjective optimization with genetic algorithms as a sequence of decision making problems interleaved with search steps, in order to accommodate previous work in the field and develops a unified approach to multiple objective and constraint handling with genetic algorithm.
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
  • G. Rudolph
  • Mathematics, Computer Science
    Evolutionary Programming
  • 1998
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal points of a
Characterization of Pareto and Lexicographic Optimal Solutions
Two important solution concepts in the theory of multicriteria decision making are Pareto optimum and Lexicographic optimum.
Multiple Objective Decision Making - Methods and Applications: A State-of-the-Art Survey
I. Introduction.- II. Basic Concepts and Foundations.- 1. Definitions.- 1.1 Terms for MCDM Environment.- 1.2 MCDM Solutions.- 2. Models for MADM.- 2.1 Noncompensatory Model.- 2.2 Compensatory Model.-
Evolutionary algorithms in theory and practice
  • D. Fogel
  • Computer Science, Mathematics
    Complex.
  • 1997
Handbook of Evolutionary Computation . Chap. Multicriterion Decision Making
  • Handbook of Evolutionary Computation . Chap. Multicriterion Decision Making
  • 1997
...
...