.png){kind=icon}
Return
An Improved Binary Quadratic Interpolation Optimization for 0-1 Knapsack Problems
.png){kind=icon}
OA
AI
DOI：10.61185/smij.2023.44101.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new binary optimization technique for solving the 0–1 knapsack problem. This algorithm is based on converting the continuous search space of the recently proposed quadratic interpolation optimization (QIO) into discrete search space using various V-shaped and S-shaped transfer functions; this algorithm is abbreviated as BQIO. To further improve its performance, it is effectively integrated with a uniform crossover operator and a swap operator to explore the discrete binary search space more effectively. This improved variant is called BIQIO. Both BQIO and BIQIO are assessed using 20 well-known knapsack instances and compared to four recently published metaheuristic algorithms to reveal their effectiveness. The comparison among algorithms is based on three performance metrics: the mean fitness value, Friedman mean rank and computational cost. The first two metrics are used to observe the accuracy of the results, while the last metric is employed to show the efficiency of each algorithm. The results of this comparison reveal the superiority of BIQIO over the classical BQIO and four rival optimizers.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available