%0 Journal Article
%T Improved DE/EDA algorithm for difficult COPs<br>改进DE/EDA算法在求解难约束优化问题中的应用研究*
%A WANG Xiang
%A DONG Xiao-m
%A YAN Rui-xi
%A LIU Hua-ling
%A <br>王翔
%A 董晓马
%A 阎瑞霞
%A 刘华玲
%J 计算机应用研究
%D 2010
%I 
%X 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.
%K K-means
%K interaction force among molecules
%K data field
%K text clustering<br>约束优化问题
%K 差分/分布式估计算法
%K 差分进化算法
%K 简单罚函数法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=0D1C0ABD4AD18583EC01387B331FC9D4&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=708DD6B15D2464E8&sid=E840A49E93704545&eid=E8726D4B90AF106C&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=11