.png){kind=icon}
返回
Directed searching optimization algorithm for constrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.01.079.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A directed searching optimization algorithm (DSO) is proposed to solve constrained optimization problems in this paper. The proposed algorithm includes two important operations position updating and genetic mutation. Position updating enables the non-best solution vectors to mimic the best one, which is beneficial to the convergence of the DSO; genetic mutation can increase the diversity of individuals, which is beneficial to preventing the premature convergence of the DSO. In addition, we adopt the penalty function method to balance objective and constraint violations. We can obtain satisfactory solutions for constrained optimization problems by combining the DSO and the penalty function method. Experimental results indicate that the proposed algorithm can be an efficient alternative on solving constrained optimization problems. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Directed searching optimization algorithm
Constrained optimization problems
Position updating
Genetic mutation
Penalty function method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏Leisure time physical activity and dementia risk: a dose-response meta-analysis of prospective studies.png)
BMJ Open
OAAI
BMJ OpenIF0
OAAI分享收藏
查看更多内容