返回
A multiobjective evolutionary algorithm for approximating the efficient set
DOI:10.1016/j.ejor.2005.05.031.png)
摘要
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.
Keyword:
evolutionary computation
multiple objective programming
evolutionary algorithms
continuous optimization
efficient set
stochastic convergence
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
8.1W
机构
暂无机构信息
引用论文
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

