An elite opposition-flower pollination algorithm for a 0-1 knapsack problem

  title={An elite opposition-flower pollination algorithm for a 0-1 knapsack problem},
  author={Mohamed Abdel-Basset and Yongquan Zhou},
  journal={Int. J. Bio Inspired Comput.},
The knapsack problem is one of the most studied combinatorial optimisation problems with various practical applications. In this paper, we apply an elite opposition-flower pollination algorithm (EFPA), to solve 0-1 knapsack problem, an NP-hard combinatorial optimisation problem. The performance of the proposed algorithm is tested against a set of benchmarks of knapsack problems. Computational experiments with a set of large-scale instances show that the EFPA can be an efficient alternative for… 

Figures and Tables from this paper

An efficient population-based simulated annealing algorithm for 0–1 knapsack problem
The next version of SA algorithms for KP01 can be enhanced by designing a population-based version of them and choosing the greedy-based approaches for the initial solution phase and local search policy.
Binary social group optimization algorithm for solving 0-1 knapsack problem
Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.
An improved cuckoo search algorithm for integer programming problems
The results show that ECS algorithm has faster convergence speed, higher computational precision and is more effective for solving integer programming problems.
A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem
A modified binary pigeon-inspired optimization algorithm named (Modified-BPIO) for the 0 - 1 multidimensional knapsack problem (MKP) has a better performance when compared with the BPIO and existing state-of-the-arts that worked on the same MKP benchmarks.
List-Based Simulated Annealing Algorithm With Hybrid Greedy Repair and Optimization Operator for 0–1 Knapsack Problem
Comparing experiments have shown that LBSA algorithm is better than or competitive with other state-of-the-art metaheuristics.
Noising methods with hybrid greedy repair operator for 0–1 knapsack problem
Simulation results show that NMs are better than or competitive with other state-of-the-art metaheuristics on a wide range of small size, medium size, and large size 0–1 KP instances.
Clustering-Based Monarch Butterfly Optimization for Constrained Optimization
An improved clustering-basedMBOnamely CBMBO is proposed, which is compared with six basic and four improved metaheuristic algorithms on twenty-eight CEC 2017 constrained problems with dimension of 30, 50, and 100, and suggests a significant addition to the portfolio of computational intelligence techniques.
A binary monkey search algorithm variation for solving the set covering problem
This work presents an improved binary version of the monkey search algorithm for solving the set covering problem, naturally inspired by the cognitive behavior of monkeys for climbing mountains, with a new climbing process with a better exploratory capability and a new cooperation procedure to reduce the number of unfeasible solutions.
An enhanced monarch butterfly optimization with self-adaptive crossover operator for unconstrained and constrained optimization problems
An improved MBO algorithm with self-adaptive crossover namely SACMBO, is proposed for unstrained and constrained optimization problems and the experimental results indicate that the proposed SacMBO algorithm outperforms the basic MBO and other five state-of-the-art metaheuristic algorithms.
A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem
A hybrid algorithm that makes use of the db-scan unsupervised learning technique to obtain binary versions of continuous swarm intelligence algorithms and produces more consistent results compared to transfer function (TF) and random operators.


Solving 0-1 knapsack problem by a novel global harmony search algorithm
Particle Swarm Optimization for the Multidimensional Knapsack Problem
The application of Particle Swarm Optimization for the multidimensional 0/1 knapsack problem is presented, using selected instances of ORLib to suggest the potential of a simple PSO for this class of combinatorial problems.
An improved monkey algorithm for a 0-1 knapsack problem
Elite opposition-based flower pollination algorithm
A Genetic Algorithm for the Multidimensional Knapsack Problem
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.
Flower Pollination Algorithm for Global Optimization
This paper proposes a new algorithm, namely, flower pollination algorithm, inspired by the pollination process of flowers, and uses it to solve a nonlinear design benchmark, which shows the convergence rate is almost exponential.
Greedy genetic algorithm for solving knapsack problems and its applications
Using GGA, a best solution of famous knapsack sample is found and calculation results show that the global con- vergence of GGA is much more superior to HGA.
Study of Greedy-policy-based Algorithm for 0/1 Knapsack Problem
This paper proposes an improved algorithm which repeats the greedy selection and proves that the ratio of the approximate solution and optimal solution is k/(k+1) and implements this algorithm.
Landscape analyses and global search of knapsack problems
  • Hiroki Yoshizawa, Shuji Hashimoto
  • Computer Science
    Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0
  • 2000
A new algorithm is proposed to estimate the optimum point by introducing the least mean square method to fit the global structure at some points selected randomly in the search space to contradict "no free lunch" theorems.
A Complex-valued Encoding Bat Algorithm for Solving 0–1 Knapsack Problem
The complex-valued encoding method which can be considered as an efficient global optimization strategy is introduced to the bat algorithm and can effectively diversify bat population and improve the convergence performance.