An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem

Abstract

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), named the AFDO, to solve the BPP. The proposed algorithm is based on the generation of a feasible initial population through a modified well-known first fit (FF) heuristic approach. To obtain a final optimized solution, the most critical parameters of the algorithm are adapted for the problem. To the best of our knowledge, this is the first study to apply the FDO algorithm in a discrete optimization problem, especially for solving the BPP. The adaptive algorithm was tested on 30 instances obtained from benchmark datasets. The performance and evaluation results of this algorithm were compared with those of other popular algorithms, such as the particle swarm optimization (PSO) algorithm, crow search algorithm (CSA), and Jaya algorithm. The AFDO algorithm obtained the smallest fitness values and outperformed the PSO, CS, and Jaya algorithms by 16%, 17%, and 11%, respectively. Moreover, the AFDO shows superiority in terms of execution time with improvements over the execution times of the PSO, CS, and Jaya algorithms by up to 46%, 54%, and 43%, respectively. The experimental results illustrate the effectiveness of the proposed adaptive algorithm for solving the 1D-BPP. INDEX TERMS Bin packing, first fit heuristic, fitness-dependent optimizer, swarm intelligent algorithms.

A Hybrid Heartbeats Classification Approach Based on Marine Predators Algorithm and Convolution Neural Networks

“…They categorized coronary artery diseases using various classifier forms. This classification was conducted using metaheuristic optimization techniques, such as nature, optimization of particle swarm (PSO) [20], GA [21], Archimedes optimization algorithm (AOA) [22], optimization of chemical reaction (CRO) [23], Henry gas solubility optimization (HGSO) [24], Harris hawks optimization (HHO) [25], [26], Marine Predators Algorithm (MPA) [27] , Barnacles Mating Optimizer (BMO) algorithm [28] , Tunicate Swarm Algorithm (TSA) [29] , Gradient-Based Optimizer (GBO) [30] , Turbulent Flow of Water-Based Optimization (TFWBO) [31] , Owl search algorithm (OSA) [32] , Fitness-Dependent optimizer (FDO) [33] , Squirrel Search Algorithm (SSA) [34] , and sine cosine algorithm (SCA) [35]. In [36], the discrete wavelet transform (DWT) performance and SVM coronary heart diseases, decision tree (DT), K-nearest neighbor, and neural network probability classifiers were compared to identify normal and nonlinear techniques.…”

Improved-Fitness Dependent Optimizer Based FOI-PD Controller for Automatic Generation Control of Multi-Source Interconnected Power System in Deregulated Environment

“…This algorithm has been tested on 19 classical benchmark functions and three practical problems which shows outstanding performance as compared to other recent techniques [46]. Furthermore, the efficiency of the algorithm has also been evaluated on AGC problem [30] and also for the optimization of one-dimensional bin packing combinatorial problem [47]. FDO algorithm has fewer parameters comparing to other algorithms, this makes FDO much simpler, less complex, and faster.…”

Metaheuristic Approaches for One-Dimensional Bin Packing Problem: A Comparative Performance Study

“…Abd Elminaam, et al, [65] proposed an adaptive procedure using a recently optimized swarm algorithm and fitnessdependent optimizer (FDO), named the AFDO, to solve the onedimensional BPP. Their algorithm was based on the generation of a feasible initial population through a modified well-known first fit heuristic approach, in which the authors adapted the most critical parameters of the algorithm for the problem to obtain a final optimized solution.…”