Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound

Authors:
José E. Gallardo;Carlos Cotta;Antonio J. Fernández
Affiliations:
Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Málaga, Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Málaga, Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Málaga, Spain
Venue:
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Year:
2005

Citing 10
Cited 0

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
The zero/one multiple knapsack problem and genetic algorithms

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Permutation-based evolutionary algorithms for multidimensional knapsack problems

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Handbook of Evolutionary Computation

Handbook of Evolutionary Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems

Journal of Heuristics
Embedding Branch and Bound within Evolutionary Algorithms

Applied Intelligence
On the futility of blind search: An algorithmic view of “no free lunch”

Evolutionary Computation
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hybridization of an evolutionary algorithm (EA) with the branch and bound method (B&B) is presented in this paper. Both techniques cooperate by exchanging information, namely lower bounds in the case of the EA, and partial promising solutions in the case of the B&B. The multidimensional knapsack problem has been chosen as a benchmark. To be precise, the algorithms have been tested on large problems instances from the OR-library. As it will be shown, the hybrid approach can provide high quality results, better than those obtained by the EA and the B&B on their own.