Abstract Recently, a novel meta-heuristic algorithm known as the marine predators algorithm (MPA) has been proposed for solving continuous optimization problems. Despite the significant superiority of MPA in solving continuous problems, the algorithm is not applicable to binary problems. This work proposes a binary version of MPA for solving the 0–1 knapsack (KP01) problem. To develop the binary variant of MPA (BMPA), a wide range of V-Shaped and S-shaped transfer functions is investigated for mapping continuous values to binary. The performance of a binary algorithm is first shown to heavily rely on the selection of an appropriate transfer function on a specific dataset. The performance of the proposed BMPA algorithm is then tested on a set of KP01 problems and compared to a number of existing algorithms. The results demonstate the merits of the BMPAs proposed in this work.

中文翻译：

---

0-1背包问题的新二元海洋捕食者优化算法

摘要 最近，提出了一种新的元启发式算法，称为海洋捕食者算法（MPA），用于解决连续优化问题。尽管 MPA 在解决连续问题方面具有显着优势，但该算法不适用于二元问题。这项工作提出了一个二进制版本的 MPA 来解决 0-1 背包 (KP01) 问题。为了开发 MPA (BMPA) 的二进制变体，研究了各种 V 形和 S 形传递函数，用于将连续值映射到二进制。二进制算法的性能首先被证明在很大程度上依赖于在特定数据集上选择合适的传递函数。然后在一组 KP01 问题上测试所提出的 BMPA 算法的性能，并与许多现有算法进行比较。