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

Full description

Bibliographic Details
Main Authors: Diaa Salama Abdul-Minaam, Wadha Mohammed Edkheel Saqar Al-Mutairi, Mohamed A. Awad, Walaa H. El-Ashmawi
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9057531/