So it is often used to solve combinatorial optimization problems ... actual requirements in time. In this paper the idea of using the parallel artificial fish swarm algorithm based on MPI to solve the ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...