|
|||||
|
|
| 改进DE/EDA算法在求解难约束优化问题中的应用研究* | |
| 引用本文： | 王翔,董晓马,阎瑞霞,刘华玲.改进DE/EDA算法在求解难约束优化问题中的应用研究*[J].计算机应用研究,2010,27(11):4114-4117. |
| 作者姓名： | 王翔 董晓马 阎瑞霞 刘华玲 |
| 作者单位： | 1. 郑州航空工业管理学院,郑州,450015 2. 东华大学,旭日工商管理学院,上海,200051 3. 上海对外贸易学院,上海,200336 |
| 基金项目： | 航空科学基金资助项目（2008ZA55004）； 上海高等教育内涵建设“085”工程资助课题（z08509008-02） |
| 摘 要： | 针对约束优化问题13个Benchmark函数中最难求解的Bump函数，利用简单罚函数算子对DE/EDA算法进行改进，提出了改进DE/EDA算法。仿真实验结果表明,求解Bump函数最优解时，改进DE/EDA算法优于其他文献的算法，且比DE算法收敛速度更快，求解效果更好。 |
| 关 键 词： | 约束优化问题 差分/分布式估计算法 差分进化算法 简单罚函数法 |
Improved DE/EDA algorithm for difficult COPs |
|
| WANG Xiang,DONG Xiao-m,YAN Rui-xi,LIU Hua-ling.Improved DE/EDA algorithm for difficult COPs[J].Application Research of Computers,2010,27(11):4114-4117. | |
| Authors: | WANG Xiang DONG Xiao-m YAN Rui-xi LIU Hua-ling |
| Affiliation: | (1.Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou 450015, China; 2.Glorious Sun School of Business & Management, Donghua University, Shanghai 200051, China; 3.Shanghai Institute of Foreign Trade, Shanghai 200336, China) |
| 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. |
| Keywords: | K-means interaction force among molecules data field text clustering |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 | |
| 点击此处可从《计算机应用研究》下载全文 | |