CAJ | 학술논문

0-1背包问题是经典组合优化NP难题。在蝙蝠算法的基础上结合遗传变异的思想，引入主动进化算子、无效蝙蝠和当前最优位置蝙蝠集聚的处理规则，提出了遗传变异蝙蝠算法，并将其用于求解0-1背包问题。仿真结果表明：该算法在收敛速度和精度上优于基本蝙蝠算法，并且能够有效地求解0-1背包问题。
0-1배포문제시경전조합우화NP난제。재편복산법적기출상결합유전변이적사상，인입주동진화산자、무효편복화당전최우위치편복집취적처리규칙，제출료유전변이편복산법，병장기용우구해0-1배포문제。방진결과표명：해산법재수렴속도화정도상우우기본편복산법，병차능구유효지구해0-1배포문제。
0-1 knapsack problem is a typical NP-hard combinatorial optimization problem. A new hybrid intelligent algo-rithm 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.