Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application

This paper examines the performance of three binary metaheuristic algorithms when applied to two distinct knapsack problems (0–1 knapsack problems (KP01) and multidimensional knapsack problems (MKP)). These binary algorithms are based on the classical mantis search algorithm (MSA), the classical qua...

Full description

Bibliographic Details

Published in:	Journal of King Saud University. Computer and information sciences Vol. 36; no. 6; p. 102093
Main Authors:	Mohamed Abdel-Basset, Reda Mohamed, Safaa Saber, Ibrahim M. Hezam, Karam M. Sallam, Ibrahim A. Hameed
Format:	Journal Article
Language:	English
Published:	Springer 01.07.2024
Subjects:	Knapsack problems Merkle–Hellman knapsack cryptosystem Metaheuristic algorithms Repair operator 2
ISSN:	1319-1578
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!