Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (11): 49-52.

Previous Articles     Next Articles

Genetic mutation bat algorithm for 0-1 knapsack problem

LI Zhiyong, MA Liang, ZHANG Huizhen   

  1. School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China
  • Online:2014-06-01 Published:2015-04-08

遗传变异蝙蝠算法在0-1背包问题上的应用

李枝勇,马  良,张惠珍   

  1. 上海理工大学 管理学院,上海 200093

Abstract: 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem. A new hybrid intelligent algorithm for solving the 0-1 knapsack problem, is presented in this paper by combining genetic mutation with bat algorithm. Moreover, the active evolutionary operators and the methods of converting invalid bats into valid ones as well as avoiding bat gathering are introduced into the new hybrid algorithm for maintaining the diversified bat population and improving the convergence performance. Simulation results show that the new hybrid algorithm can solve the 0-1 knapsack problem effectively, and has better convergence rate and higher computation precision than the bat algorithm.

Key words: bat algorithm, 0-1 knapsack problem, genetic mutation

摘要: 0-1背包问题是经典组合优化NP难题。在蝙蝠算法的基础上结合遗传变异的思想,引入主动进化算子、无效蝙蝠和当前最优位置蝙蝠集聚的处理规则,提出了遗传变异蝙蝠算法,并将其用于求解0-1背包问题。仿真结果表明:该算法在收敛速度和精度上优于基本蝙蝠算法,并且能够有效地求解0-1背包问题。

关键词: 蝙蝠算法, 0-1背包问题, 遗传变异