An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem
In recent years, the one-dimensional bin packing problem (1D-BPP) has become one of the most famous combinatorial optimization problems.The 1D-BPP is a robust NP-hard problem that can be solved through optimization algorithms.This paper proposes an adaptive procedure using a recently optimized swarm algorithm and fitness-dependent optimizer (FDO),