本文已被：浏览 2231次 下载 2892次
Received:August 26, 2017 Revised:September 15, 2017
Received:August 26, 2017 Revised:September 15, 2017
中文摘要: 0-1背包问题是一个经典的NP完全问题，该问题在实际生活中具有广泛的应用.针对现有算法在求解0-1背包问题时精度不高的缺点，提出了一种诱导因子猴群算法.所给诱导因子猴群算法的基本思想是，在基本猴群算法的爬过程中引入诱导因子，诱导其向上爬行，从而可以逃逸局部最优解，找到全局最优解.在仿真试验中，与已有方法进行比较，结果说明利用所给诱导因子猴群算法求解0-1背包问题是有效的.
Abstract:The 0-1 knapsack problem is a classical NP complete problem, which has a wide range of applications in real life. In view of the existing algorithms with the shortcoming of low precision in solving 0-1 knapsack problem, an inducing factor monkey algorithm is proposed to solve the problem. The basic idea of the proposed inducing factor monkey algorithm is that an inducing factor is adopted in the climbing process of the basic monkey algorithm to induce it to crawl upward, which can escape from local optimal solution and find the global optimal solution. In the simulation, compared with the existing methods, the results show that the proposed inducing factor monkey algorithm for solving 0-1 knapsack problem is valid.
keywords: 0-1 knapsack problem combinatorial optimization swarm intelligence inducing factor monkey algorithm
文章编号： 中图分类号： 文献标志码：
基金项目:国家自然科学基金（61773016）；陕西省自然科学基础研究计划项目（2014JM8325）；陕西省教育厅专项科研计划项目（14JK1538）；西安理工大学科技创新计划项目（2016CX013）
引用文本：
徐小平,师喜婷,钱富才.基于猴群算法求解0-1背包问题.计算机系统应用,2018,27(5):133-138
XU Xiao-Ping,SHI Xi-Ting,QIAN Fu-Cai.Solving 0-1 Knapsack Problem Based on Monkey Algorithm.COMPUTER SYSTEMS APPLICATIONS,2018,27(5):133-138
徐小平,师喜婷,钱富才.基于猴群算法求解0-1背包问题.计算机系统应用,2018,27(5):133-138
XU Xiao-Ping,SHI Xi-Ting,QIAN Fu-Cai.Solving 0-1 Knapsack Problem Based on Monkey Algorithm.COMPUTER SYSTEMS APPLICATIONS,2018,27(5):133-138
