arrow
返回

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
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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/).
Keyword:
0-1 knapsack problem
Multidimensional knapsack
Transfer function
Light spectrum optimizer
Swarm and evolutionary
behaviors based improve
ment strategy
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Alexandria Engineering Journal 封面图
Alexandria Engineering Journal
IF:
6.8
论文数:
6.3K
被引数:
2.6W

机构

E
egyptian knowledge bank (ekb)
学者数:
11.6W
论文数: 9.3W
被引数: 84
M
Mansoura University
学者数:
7.6K
论文数: 6.0K
被引数: 1.1W
M
michigan state university
学者数:
3.6W
论文数: 3.2W
被引数: 44
Z
Zagazig University
学者数:
6.2K
论文数: 5.1K
被引数: 91
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
The Whale Optimization Algorithm鲸鱼优化算法
err2016-05-01
err9.5K
PREAI
errMirjalili, Seyedali; Lewis, Andrew
err分享
err收藏
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.
err分享
err收藏
学者 查看更多内容