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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| 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!
|