A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Where are the hard knapsack problems?
Computers and Operations Research
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A discrete version of particle swarm optimization for flowshop scheduling problems
Computers and Operations Research
Lévy flights, non-local search and simulated annealing
Journal of Computational Physics
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
A new grouping genetic algorithm for the quadratic multiple knapsack problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Kernel search: A general heuristic for the multi-dimensional knapsack problem
Computers and Operations Research
Information Sciences: an International Journal
Review Article: Solving 0-1 knapsack problem by a novel global harmony search algorithm
Applied Soft Computing
A novel quantum inspired cuckoo search for knapsack problems
International Journal of Bio-Inspired Computation
Apply the particle swarm optimization to the multidimensional knapsack problem
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
Journal of Computational and Applied Mathematics
Solving 0-1 knapsack problem by continuous ACO algorithm
International Journal of Computational Intelligence Studies
Hi-index | 0.00 |
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.