欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：