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

Amira Gherboudj, Abdesslem Layeb, Salim Chikhi
2012 International Journal of Bio-Inspired Computation (IJBIC)  
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
more » ... ion 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. He is currently a Professor at the Mentouri University, Constantine, Algeria. He is the Leader of the SCAL team of MISC Laboratory. His research areas include soft computing and artificial life techniques and their application in several domains.
doi:10.1504/ijbic.2012.048063 fatcat:itdsusbro5e3fo4bg3cm4avcgq