混合差异演化算法求解多维背包问题

摘要

提出了一种求解多维0-1背包问题的混合差异演化算法,算法使用了两个主要的思想策略,即依据物品单位容积价值的高低选择物品的贪婪算法和基于二进制编码的差异演化算法.对10个测试算例进行了仿真试验,结果表明文章提出的算法可以快速找到这些测试算例的最优解,是求解多维背包问题的一种有效方法.%Proposed a hybrid differential evolution to solve multidimensional 0-1 knapsack problem in this paper.The algorithm utilizes two important strategies, i.e.how to select the item based on its average value and the binary differential evolution.The hybrid differential evolution is applied to 10 multidimensional 0-1 knapsack test instances and the experimental results show the proposed algorithm is rather efficient for solving multidimensional 0-1 knapsack problem.