Title: Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm

Authors: Amira Gherboudj; Abdesslem Layeb; Salim Chikhi

Addresses: MISC Laboratory, Computer Science Department, Mentouri University Constantine, Route Ain El Bey, Constantine 25017, Algeria. ' MISC Laboratory, Computer Science Department, Mentouri University Constantine, Route Ain El Bey, Constantine 25017, Algeria. ' MISC Laboratory, Computer Science Department, Mentouri University Constantine, Route Ain El Bey, Constantine 25017, Algeria

Abstract: Cuckoo search (CS) is one of the most recent population-based meta-heuristics. CS algorithm is based on the cuckoo's behaviour and the mechanism of Lévy flights. Unfortunately, the standard CS algorithm is proposed only for continuous optimisation problems. In this paper, we propose a discrete binary cuckoo search (BCS) algorithm in order to deal with binary optimisation problems. To get binary solutions, we have used a sigmoid function similar to that used in the binary particle swarm optimisation algorithm. Computational results on some knapsack problem instances and multidimensional knapsack problem instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions.

Keywords: combinatorial optimisation; evolutionary computation; binary cuckoo search; multidimensional knapsack problem; metaheuristics.

DOI: 10.1504/IJBIC.2012.048063

International Journal of Bio-Inspired Computation, 2012 Vol.4 No.4, pp.229 - 236

Published online: 18 Jul 2012 *

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