An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis

Abstract This paper presents a binary variant of the recently proposed spider wasp optimizer (SWO), namely BSWO, for accurately tackling the multidimensional knapsack problem (MKP), which is classified as an NP-hard optimization problem. The classical methods could not achieve acceptable results for...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohamed Abdel-Basset, Reda Mohamed, Karam M. Sallam, Ibrahim Alrashdi, Ibrahim A. Hameed
Format: Article
Language:English
Published: SpringerOpen 2025-01-01
Series:Journal of Big Data
Subjects:
Online Access:https://doi.org/10.1186/s40537-024-01055-9
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832571618039169024
author Mohamed Abdel-Basset
Reda Mohamed
Karam M. Sallam
Ibrahim Alrashdi
Ibrahim A. Hameed
author_facet Mohamed Abdel-Basset
Reda Mohamed
Karam M. Sallam
Ibrahim Alrashdi
Ibrahim A. Hameed
author_sort Mohamed Abdel-Basset
collection DOAJ
description Abstract This paper presents a binary variant of the recently proposed spider wasp optimizer (SWO), namely BSWO, for accurately tackling the multidimensional knapsack problem (MKP), which is classified as an NP-hard optimization problem. The classical methods could not achieve acceptable results for this problem in a reasonable amount of time. Therefore, the researchers have recently turned their focus to metaheuristic algorithms to address this problem more accurately and in an acceptable amount of time. However, the majority of metaheuristic algorithms proposed for MKP suffer from slow convergence speed and low quality of final results, especially as the number of dimensions increases. This motivates us to present BSWO discretized using nine well-known transfer functions belonging to three categories—X-shaped, S-shaped, and V-shaped families—for effectively and efficiently tackling this problem. In addition, it is integrated with the improved repair operator 4 (RO4) to present a hybrid variant, namely BSWO-RO4, which could effectively repair and improve infeasible solutions for achieving better performance. Several small, medium, and large-scale MKP instances are used to assess both BSWO and BSWO-RO4. The usefulness and efficiency of the proposed algorithms are also demonstrated by comparing both of them to several metaheuristic optimizers in terms of some performance criteria. The experimental findings demonstrate that BSWO-RO4 can achieve exceptional results for the small and medium-scale instances, while the genetic algorithm integrated with RO4 can be superior for the large-scale instances. Additionally, the results of the experiments demonstrate that BSWO integrated with RO4 is more efficient than BSWO integrated with RO2.
format Article
id doaj-art-d9d1d4d047c84c5f9a6f02948a471b6b
institution Kabale University
issn 2196-1115
language English
publishDate 2025-01-01
publisher SpringerOpen
record_format Article
series Journal of Big Data
spelling doaj-art-d9d1d4d047c84c5f9a6f02948a471b6b2025-02-02T12:28:32ZengSpringerOpenJournal of Big Data2196-11152025-01-0112115610.1186/s40537-024-01055-9An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysisMohamed Abdel-Basset0Reda Mohamed1Karam M. Sallam2Ibrahim Alrashdi3Ibrahim A. Hameed4Faculty of Computers and Informatics, Zagazig UniversityFaculty of Computers and Informatics, Zagazig UniversityDepartment of Computer Science, University of SharjahDepartment of Computer Science, College of Computer and Information Sciences, Jouf UniversityDepartment of ICT and Natural Sciences, Norwegian University of Science and Technology (NTNU)Abstract This paper presents a binary variant of the recently proposed spider wasp optimizer (SWO), namely BSWO, for accurately tackling the multidimensional knapsack problem (MKP), which is classified as an NP-hard optimization problem. The classical methods could not achieve acceptable results for this problem in a reasonable amount of time. Therefore, the researchers have recently turned their focus to metaheuristic algorithms to address this problem more accurately and in an acceptable amount of time. However, the majority of metaheuristic algorithms proposed for MKP suffer from slow convergence speed and low quality of final results, especially as the number of dimensions increases. This motivates us to present BSWO discretized using nine well-known transfer functions belonging to three categories—X-shaped, S-shaped, and V-shaped families—for effectively and efficiently tackling this problem. In addition, it is integrated with the improved repair operator 4 (RO4) to present a hybrid variant, namely BSWO-RO4, which could effectively repair and improve infeasible solutions for achieving better performance. Several small, medium, and large-scale MKP instances are used to assess both BSWO and BSWO-RO4. The usefulness and efficiency of the proposed algorithms are also demonstrated by comparing both of them to several metaheuristic optimizers in terms of some performance criteria. The experimental findings demonstrate that BSWO-RO4 can achieve exceptional results for the small and medium-scale instances, while the genetic algorithm integrated with RO4 can be superior for the large-scale instances. Additionally, the results of the experiments demonstrate that BSWO integrated with RO4 is more efficient than BSWO integrated with RO2.https://doi.org/10.1186/s40537-024-01055-9Spider wasp optimizerMulti-dimensional knapsack problemInfeasible solutionsRepair operator
spellingShingle Mohamed Abdel-Basset
Reda Mohamed
Karam M. Sallam
Ibrahim Alrashdi
Ibrahim A. Hameed
An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
Journal of Big Data
Spider wasp optimizer
Multi-dimensional knapsack problem
Infeasible solutions
Repair operator
title An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
title_full An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
title_fullStr An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
title_full_unstemmed An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
title_short An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
title_sort efficient binary spider wasp optimizer for multi dimensional knapsack instances experimental validation and analysis
topic Spider wasp optimizer
Multi-dimensional knapsack problem
Infeasible solutions
Repair operator
url https://doi.org/10.1186/s40537-024-01055-9
work_keys_str_mv AT mohamedabdelbasset anefficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT redamohamed anefficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT karammsallam anefficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT ibrahimalrashdi anefficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT ibrahimahameed anefficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT mohamedabdelbasset efficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT redamohamed efficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT karammsallam efficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT ibrahimalrashdi efficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis
AT ibrahimahameed efficientbinaryspiderwaspoptimizerformultidimensionalknapsackinstancesexperimentalvalidationandanalysis