遗传变异蝙蝠算法在0_1背包问题上应用.pdfVIP

网络出版时间：2012-10-11 10:19 网络出版地址：/kcms/detail/11.2127.TP1019.027.html Computer Engineering and Applications   LI Zhiyong, MA Liang, ZHANG Huizhen School of Management,University of Shanghai for Science and Technology, Shanghai 200093,China LI Zhiyong, MA Liang, ZHANG Huizhen. Genetic mutation bat algorithm for 0-1 knapsack problem.Computer Engineering and Applications Abstract:0-1 knapsack problem is a typical NP-hard combinatorial optimization problem. Genetic mutationbat algorithm, 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. Keywords: bat algorithm; 0-1 knapsack problem;genetic mutation ⎧⎪n w x ≤C ∑ i i ⎨i 1 ⎪ xi ∈{0,1}