全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Improved DE/EDA algorithm for difficult COPs
改进DE/EDA算法在求解难约束优化问题中的应用研究*

Keywords: K-means,interaction force among molecules,data field,text clustering
约束优化问题
,差分/分布式估计算法,差分进化算法,简单罚函数法

Full-Text   Cite this paper   Add to My Lib

Abstract:

Bump function is the most difficult to solve in the 13 Benchmark functions about the constrained optimization problems. It is solved by a improved DE / EDA algorithm, which used a simple penalty function operator to improve the DE / EDA algorithm. Simulation results show that the solutions of improved DE/EDA algorithm is better than those of other algorithms in the literatures when solving the Bump function. The convergence of improved DE/EDA algorithm is faster than that of DE and solution is also better.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133