首页 | 本学科首页   官方微博 | 高级检索  
     

求解背包问题的改进差异演化算法
引用本文:邓长寿,梁昌勇. 求解背包问题的改进差异演化算法[J]. 计算机工程与应用, 2008, 44(32): 12-14. DOI: 10.3778/j.issn.1002-8331.2008.32.004
作者姓名:邓长寿  梁昌勇
作者单位:合肥工业大学,计算机网络系统研究所,合肥,230009;九江学院,信息科学与技术学院,江西,九江,332005;合肥工业大学,计算机网络系统研究所,合肥,230009
摘    要:提出一种求解0-1背包问题的改进差异演化算法。首先对差异演化算法的选择操作进行修改,得到的改进差异演化算法可以直接有效地处理约束优化问题。其次,利用一种新的区间编码映射机制,将差异演化算法扩展到求解离散领域优化问题。仿真实验结果表明,与其他进化算法相比,改进差异演化算法求解经典背包问题时,求解精度高,收敛速度快,是求解经典背包问题的一种高效算法。

关 键 词:背包问题  差异演化  区间编码映射  选择操作
收稿时间:2008-07-29
修稿时间:2008-8-18 

Improved differential evolution algorithm for knapsack problem
DENG Chang-shou,LIANG Chang-yong. Improved differential evolution algorithm for knapsack problem[J]. Computer Engineering and Applications, 2008, 44(32): 12-14. DOI: 10.3778/j.issn.1002-8331.2008.32.004
Authors:DENG Chang-shou  LIANG Chang-yong
Affiliation:1.Institute of Computer Network System,Hefei University of Technology,Hefei 230009,China 2.School of Information Science and Technology,Jiujiang University,Jiujiang,Jiangxi 332005,China
Abstract:An improved differential evolution algorithm was proposed to solve the classical knapsack problem.The selection opera- tion in original differential evolution was adapted to deal with constraints directly.Using a new range encoding mapping,the dif- ferential evolution algorithm can be used to deal with discrete optimization problem.The simulation results of the improved differ- ential evolution algorithm show,compared with other evolution algorithm,the improved differential evolution is effective in solving 0-1 Knapsack Problems.
Keywords:knapsack problem  differential evolution  range encoding mapping  selection operation
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号