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 ...

A New binary Marine Predators Optimization Algorithm is developed for 0–1 KPs. · An initial elite population generator is proposed. · We used large size instances ...

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 ...

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 ...

Semantic Scholar extracted view of "New binary marine predators optimization algorithms for 0–1 knapsack problems" by Mohamed Abdel-Basset et al.

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 ...

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 ...

Key takeaway: 'The binary marine predators algorithm (BMPA) outperforms existing algorithms in solving 0-1 knapsack problems, with performance relying on ...

Apr 19, 2023 · The Metaheuristic-based algorithms are efficient optimization algorithms established to tackle a wide range of optimization problems using a ...

Article "New binary marine predators optimization algorithms for 0-1 knapsack problems" Detailed information of the J-GLOBAL is an information service ...