Title: Discrete cuckoo search for 0-1 knapsack problem

Authors: Aziz Ouaarab

Addresses: Computer and Systems Engineering Laboratory, Cadi Ayyad University, Marrakesh, Morocco

Abstract: This paper presents a resolution of a space management optimisation problem such as 0-1 knapsack problems (KP) by discrete cuckoo search algorithm (DCS). The proposed approach includes an adaptation process of three main components: the objective function, the solution representation, and the step move operator. A simplified conception of these three components is designed without introducing an additional technique, especially in the search process for the optimal solution. Three sets of benchmark instances have been taken from the literature to test the performance of DCS. Experimental results prove that DCS is effective in solving different types of 0-1 KP instances. The result comparisons with other state-of-the-art algorithms show that DCS is a competitive approach that outperforms most of them.

Keywords: 0-1 knapsack problem; discrete cuckoo search; DCS; combinatorial optimisation; Lévy flights; approximate algorithm.

DOI: 10.1504/IJDMMM.2024.142593

International Journal of Data Mining, Modelling and Management, 2024 Vol.16 No.4, pp.374 - 396

Received: 23 Aug 2023
Accepted: 19 Mar 2024
Published online: 11 Nov 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article