首页 | 官方网站   微博 | 高级检索  
     

基于贪婪离散类电磁机制算法求解背包问题
引用本文:王建龙,孙合明.基于贪婪离散类电磁机制算法求解背包问题[J].计算机应用,2013,33(9):2557-2561.
作者姓名:王建龙  孙合明
作者单位:河海大学 理学院, 南京 211100
摘    要:针对基本类电磁机制算法不能够有效解决离散型的背包问题,提出了一种贪婪离散类电磁机制算法。首先,提出一种交叉操作;然后,利用提出的交叉操作对基本类电磁机制算法中的合力计算公式和粒子移动方法进行修改,使其能够适用于离散型问题;最后,引入贪婪算法的机制来处理经过类电磁机制算法迭代得到的解,使这些解满足背包问题的约束条件。通过对3个经典的背包测试问题进行的测试结果表明:该算法可以解决离散型的背包问题,并且具有较优的求解性能。

关 键 词:类电磁机制算法    背包问题    离散    约束条件    贪婪算法
收稿时间:2013-04-07
修稿时间:2013-05-12

Solution to knapsack problem based on greedy discrete electromagnetism-like mechanism algorithm
WANG Jianlong , SUN Heming.Solution to knapsack problem based on greedy discrete electromagnetism-like mechanism algorithm[J].journal of Computer Applications,2013,33(9):2557-2561.
Authors:WANG Jianlong  SUN Heming
Affiliation:College of Sciences, Hohai University, Nanjing Jiangsu 211100, China
Abstract:The basic Electromagnetism-like Mechanism (EM) algorithm cannot solve the discrete problems like knapsack problem. A new algorithm called Greedy Discrete Electromagnetism-like Mechanism (GDEM) algorithm was proposed. Firstly, a cross-operating was proposed; then the operating was used to modify the methods of the force calculation and particles movement in the basic EM algorithm; at last, greedy algorithm was introduced to process the constraint condition. Based on the three classical test knapsack problems, the results have shown that GDEM algorithm can solve knapsack problems efficiently.
Keywords:Electromagnetism-like Mechanism (EM) algorithm  Knapsack Problem (KP)  discrete  constraint condition  greedy algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号