| 一种新的解决组合优化问题的自适应柯西进化规划ACEP |
| |
| 引用本文： | 万寿红,梁肖,岳丽华,熊焰. 一种新的解决组合优化问题的自适应柯西进化规划ACEP[J]. 电子学报, 2011, 39(2): 375-377 |
| |
| 作者姓名： | 万寿红 梁肖 岳丽华 熊焰 |
| |
| 作者单位： | 中国科学技术大学计算机科学技术学院; |
| |
| 基金项目： | 国家自然科学基金(No.90818007); 国家863高技术研究发展计划(No.2009AA01Z203) |
| |
| 摘 要： | 本文在快速进化规划基础上,提出了一种解决组合优化问题的自适应柯西进化规划ACEP.该算法融合了柯西变异的优点,通过调整参量r来适当的改变搜索的步长,相对于经典进化规划CEP和快速进化规划FEP只需一半的种群数量便可快速到达问题的最优解,最后0/1背包问题的对比实验结果表明了其优越性.
|
| 关 键 词： | 自适应柯西进化规划 快速进化规划 背包问题 |
| 收稿时间： | 2009-11-06 |
A Novel Self-Adaptive Cauchy Evolutionary Programming for Combinatorial Optimization |
| |
| WAN Shou-hong,LIANG Xiao,YUE Li-hua,XIONG Yan. A Novel Self-Adaptive Cauchy Evolutionary Programming for Combinatorial Optimization[J]. Acta Electronica Sinica, 2011, 39(2): 375-377 |
| |
| Authors: | WAN Shou-hong LIANG Xiao YUE Li-hua XIONG Yan |
| |
| Affiliation: | WAN Shou-hong,LIANG Xiao,YUE Li-hua,XIONG Yan(Department of Computer Science and Technology,University of Science and Technology of China,Hefei,Anhui 230027,China) |
| |
| Abstract: | Based on fast evolutionary programming,a novel self-adaptive Cauchy evolutionary programming ACEP to solve the combinatorial optimization problem is proposed.It adopts advantages of Cauchy mutation and alters the search steps in time by adjusting the parameter.Compared with classic evolutionary programming and fast evolutionary programming,it only needs a half population size can be achieved the optimal solutions.The empirical experiments on 0/1 knapsack problem are carried out,the results have supported th... |
| |
| Keywords: | self-adaptive Cauchy evolutionary programming fast evolutionary programming knapsack problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载免费的PDF全文 |
|
