arrow
Return

Binary light spectrum optimizer for knapsack problems: An improved model

delete2023-03-01
delete16
delete
OA
AI
M
Mohamed Abdel‐Basset
R
Reda Mohamed
M
Mohamed Abouhawwash
A
Ahmad M. Alshamrani
A
Ali Wagdy Mohamed *
K
Karam M. Sallam
DOI:10.1016/j.aej.2022.12.025delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
This paper presents a binary variant of a novel physics-based meta-heuristic optimization algorithm, namely Light spectrum optimizer (LSO), for tackling both the 0-1 knapsack (KP01) and multidimensional knapsack problems (MKP). Because of the continuous nature of the standard LSO that contradicts the knapsack problem's discrete nature, two various transfer functions: S-shaped and X-shaped, are used to convert the continuous values produced by LSO into discrete ones. Some binary solutions produced by the binary LSO (BLSO) may be infeasible, so an improvement-repair strategy is used to convert those solutions into feasible ones by making some improvements on them. Moreover, the classical LSO was modified in this study to propose a new binary variant, namely BMLSO, with better exploration and exploitation operators for overcoming the knapsack problems. Additionally, a novel method, which simulates the swarm intelligence behaviors and the simulated binary crossover (SBX) to accelerate the convergence speed with avoid-ing stuck into local minima, has been proposed for producing a new binary variant of MLSO known as BHLSO. To verify the performance of the proposed binary variants of LSO, 45 bench- mark instances of KP01 and 30 benchmark instances of MKP used commonly in the literature have been used in our experiments. The experimental findings show the superiority of BHLSO for both KP01 and MKP compared with several well-known algorithms in terms of CPU time, convergence speed, and accuracy.(c) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/ licenses/by-nc-nd/4.0/).
Keywords:
0-1 knapsack problem
Multidimensional knapsack
Transfer function
Light spectrum optimizer
Swarm and evolutionary
behaviors based improve
ment strategy
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Alexandria Engineering Journal cover
Alexandria Engineering Journal
IF:
6.8
Papers:
6.3K
Citations:
2.6W

Organization

E
egyptian knowledge bank (ekb)
Scholars:
11.6W
Papers: 9.3W
Citations: 84
M
Mansoura University
Scholars:
7.6K
Papers: 6.0K
Citations: 1.1W
M
michigan state university
Scholars:
3.6W
Papers: 3.2W
Citations: 44
Z
Zagazig University
Scholars:
6.2K
Papers: 5.1K
Citations: 91
researcher View more organizations
Cited Papers

Cited Papers

The Whale Optimization Algorithm
err2016-05-01
err9.5K
PREAI
errMirjalili, Seyedali; Lewis, Andrew
errShare
errSave
IEGA: An improved elitism-based genetic algorithm for task scheduling problem in fog computing
err2021-05-27
err30
errOAAI
errAbdel-Basset, Mohamed; Mohamed, Reda; Chakrabortty, Ripon K.; Ryan, Michael J.
errShare
errSave
researcher View more