Return
A multiobjective evolutionary algorithm for approximating the efficient set
DOI:10.1016/j.ejor.2005.05.031.png)
Abstract
En 中文
In this article, a new framework for evolutionary algorithms for approximating the efficient set of a multiobjective optimization (MOO) problem with continuous variables is presented. The algorithm is based on populations of variable size and exploits new elite preserving rules for selecting alternatives generated by mutation and recombination. Together with additional assumptions on the considered MOO problem and further specifications on the algorithm, theoretical results on the approximation quality such as convergence in probability and almost sure convergence are derived. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
evolutionary computation
multiple objective programming
evolutionary algorithms
continuous optimization
efficient set
stochastic convergence
Journal
IF:
6
Papers:
2.2W
Citations:
8.1W
Organization
No organization information available
Cited Papers
Experimental observation of boundary-driven oscillations in a reaction–diffusion–advection system
Soft Matter
IF0
A computerized tomography scan method for calculating the hernia sac and abdominal cavity volume in complex large incisional hernia with loss of domain
Hernia
IF0

