.png){kind=icon}
返回
An efficient evolutionary programming algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(98)00084-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel evolutionary programming algorithm, which not only has a rapid convergence rate but also maintains the diversity of the population so as to escape from local optima, is proposed in this paper. In addition, a multi-modal test function is presented and is used to indicate the efficiency of this algorithm. Several application examples are given to show its usefulness. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
combinatorial optimization
evolutionary programming
reliability optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
