BPSOBDE: A Binary Version of Hybrid Heuristic Algorithm for Multidimensional Knapsack Problems
Authors:
- Li ZhangLZLi Zhang
- Hong LiHLHong Li
- 1 December 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 54-58
Abstract
A hybrid heuristic algorithm, named BPSOBDE, is proposed for solving multidimensional knapsack problems (MKPs), in which the basic binary particle swarm optimization (BPSO) is combined with a binary differential evolution (BDE) to maintain the diversity of the swarm and makes it more explorative, effective and efficient. BPSOBDE is tested through computational experiments over suites of benchmark problems and the obtained results are compared with those of BPSO and some modified versions of BPSO. The experimental results show that BPSOBDE can successfully locate the exact solutions of all test problems. The comparison results indicate that BPSOBDE is a competitive heuristic algorithm.Keywords
This publication has 24 references indexed in Scilit:
- An improved firefly algorithm for solving dynamic multidimensional knapsack problemsExpert Systems with Applications, 2014
- NEW BINARY PARTICLE SWARM OPTIMIZATION WITH IMMUNITY-CLONAL ALGORITHMJournal of Computer Science, 2013
- Essential Particle Swarm Optimization queen with Tabu Search for MKP resolutionComputing, 2013
- A novel modified binary differential evolution algorithm and its applicationsNeurocomputing, 2012
- A Modified Binary Particle Swarm Optimization for Knapsack ProblemsApplied Mathematics and Computation, 2012
- A fast particle swarm optimization algorithm for the multidimensional knapsack problem2012
- An effective hybrid EDA-based algorithm for solving multidimensional knapsack problemExpert Systems with Applications, 2012
- Fast, effective heuristics for the 0–1 multi-dimensional knapsack problemComputers & Operations Research, 2009
- A Socio-Cognitive Particle Swarm Optimization for Multi-Dimensional Knapsack Problem2008
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu searchComputers & Operations Research, 2005