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

@article{Gherboudj2012Solving0K,
  title={Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm},
  author={Amira Gherboudj and Abdesslem Layeb and Salim Chikhi},
  journal={Int. J. Bio Inspired Comput.},
  year={2012},
  volume={4},
  pages={229-236}
}
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 Levy 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… 

Figures and Tables from this paper

A Multi-objective Binary Cuckoo Search for Bi- criteria Knapsack Problem

Cuckoo Search (CS) is one of the most recent population-based metaheuristics. CS algorithm is based on the cuckoo's behavior and the mechanism of Levy flights. The Binary Cuckoo Search algorithm

Solving 0-1 Knapsack Problems by Binary Dragonfly Algorithm

TLDR
A binary version of dragonfly algorithm (BDA) is proposed to solve 0–1 knapsack problem, an NP-hard problem which plays significant roles in many real life applications.

A discrete binary version of bat algorithm for multidimensional knapsack problem

TLDR
A discrete binary bat algorithm BinBA, based on the sigmoid function used by Kennedy and Eberhart in 1997 for their binary particle swarm optimisation algorithm, is proposed for solving the optimisation problems in binary space.

Binary Fireworks Algorithm for 0-1 Knapsack Problem

  • Junjie XueJiyang XiaoJie Zhu
  • Computer Science
    2019 International Conference on Artificial Intelligence and Advanced Manufacturing (AIAM)
  • 2019
TLDR
A novel evolutionary algorithm, Binary Fireworks Algorithm (BFWA), is introduced for 0-1 knapsack problem and compared with Quantum Genetic Algorithm, Binary Particle Swarm Optimization and Binary Cuckoo Search, showing that BFWA has excellent searching performance.

Comparative Study of Cuckoo Inspired Metaheuristics Applying to Knapsack Problems

TLDR
A binary version of COA (called BCOA) algorithm is proposed using the Sigmoid function and the obtained results are compared with those obtained by BCS to compare the efficiency of the too algorithms.

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

TLDR
The authors introduce a new efficient population-based technique for binary optimization problems that is called EABOP and shows that the new algorithm is able of quickly obtaining high-quality solutions for most hard instances of the problem.

Adaptation of Binary Pigeon-Inspired Algorithm for Solving Multidimensional Knapsack Problem

TLDR
A new Binary pigeon-inspired optimization (Binary PIO) algorithm is proposed for solving MKP with focus on 0–1 MKP and it is concluded that the application of Binary PIO offers promising performance when compared with existing techniques from the literature.

An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems

TLDR
An improved hybrid encoding cuckoo search algorithm with greedy strategy is put forward for solving 0-1 knapsack problems and experiments show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions.

Number 12

TLDR
A binary version of COA (called BCOA) algorithm is proposed using the Sigmoid function and the obtained results are compared with those obtained by BCS to compare the efficiency of the too algorithms.

An Application of Binary Cuckoo Search Algorithm to Orienteering Problem

TLDR
A cuckoo search model based algorithm is developed that can eventually provide better solutions for some of the 18 cases than two other benchmarked algorithms and shows that the worse nest fraction affects the quality of solutions obtained.
...

References

SHOWING 1-10 OF 29 REFERENCES

BPSO Algorithms for Knapsack Problem

TLDR
4 classes of binary PSO algorithms (BPSO) for solving the NP-hard knapsack problem and results showed that the proposed algorithms outperform the Standard PSO2006 and the Standard BPSO in terms of quality of solution found.

Solving 0-1 knapsack problem by a novel global harmony search algorithm

Engineering optimisation by cuckoo search

TLDR
This paper presents a more extensive comparison study using some standard test functions and newly designed stochastic test functions to apply the CS algorithm to solve engineering design optimisation problems, including the design of springs and welded beam structures.

An Improved Genetic Algorithm Based on Adaptive Repair Operator for Solving the Knapsack Problem

TLDR
A new objective_func_evaluation operator was proposed which employed adaptive repair function named as repair and elitism operator to achieve optimal results in place of problem specific knowledge or domain specific operator like penalty operator.

Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem

TLDR
This paper proposes a new heuristic approach based on the Particle Swarm Optimization for the Multidimensional Knapsack Problem (MKP) where a heuristic repair operator utilizing problem-specific knowledge is incorporated into the modified algorithm.

A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem

TLDR
This paper has proposed a new steady-state grouping genetic algorithm for the quadratic multiple knapsack problem and compared its results with two recently proposed methods - a genetic algorithm and a stochastic hill climber.

A Genetic Algorithm for the Multidimensional Knapsack Problem

TLDR
A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach and is capable of obtaining high-quality solutions for problems of various characteristics.

Discrete Particle Swarm Optimization for Multiple Destination Routing Problems

TLDR
Experiments show that the DPSO obtains better results when compared with traditional heuristic algorithms, and also outperforms the GA-based algorithm with faster convergence speed.

A discrete version of particle swarm optimization for flowshop scheduling problems