基于S型传递函数的二进制乌鸦搜索算法求解0-1背包问题

Binary Crow Search Algorithm Based on S-Type Transfer Function for Solving 0-1 Knapsack Problem

摘要: 基于传递函数，我们提出了一种新的二进制乌鸦搜索算法(BCSA)来求解0-1背包问题(0-1KP)，它不仅保留了原有乌鸦搜索算法良好的探索能力，而且具有良好的开发能力。充分利用修复优化方法处理不可行解，在提升算法搜索能力的同时，也加快了算法的收敛速度。为验证BCSA求解0-1KP的性能，将其计算结果与七种不同算法的计算结果进行了比较，发现BCSA的求解精度高、算法稳定性良好，非常适合用来处理大规模0-1KP实例。

Abstract: Based on the transfer function, we propose a new Binary Crow Search Algorithm (BCSA) for solving the 0-1 Knapsack Problem (0-1KP). It not only retains the good exploration ability of the original crow search algorithm, but also has good development ability. Making full use of repair optimization methods to handle infeasible solutions improves the search ability of the algorithm while also accelerating its convergence speed. In order to verify the performance of BCSA in solving 0-1KP, its calculation results were compared with those of seven different algorithms. It was found that BCSA has high resolution and good algorithm stability, and is very suitable for processing large-scale 0-1KP instances.