.png){kind=icon}
返回
Evolution strategies for solving discrete optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/0965-9978(95)00104-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A method to solve discrete optimization problems using evolution strategies (ESs) is described. The ESs imitate biological evolution in nature and have two characteristics that differ from other conventional optimization algorithms: (a) ESs use randomized operators instead of the usual deterministic ones; (b) instead of a single design point, the ESs work simultaneously with a population of design points in the space of variables. The important operators of ESs are mutation, selection and recombination. The ESs are commonly applied for continuous optimization problems. For the application to discrete problems, several modifications on the operators mutation and recombination are suggested here. Several examples from the literature are solved with this modified ES and the results compared. The examples show that the modified ES is robust and suitable for discrete optimization problems. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited.
Keyword:
evolution strategies
discrete optimization problems
genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
3.4K
被引数:
1.2W
机构
暂无机构信息
引用论文
Potato field-inoculation in Ecuador with Rhizophagus irregularis: no impact on growth performance and associated arbuscular mycorrhizal fungal communities.png)
Symbiosis
SymbiosisIF0
PREAI
分享收藏 没有更多内容
没有更多内容