Paper Info
Title
Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound
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.
Year
DOI
Venue
2005
10.1007/11499305_3
IWINAC (2)
Keywords
Field
DocType
large problems instance,bound method,hybrid approach,partial promising solution,multidimensional knapsack problem,evolutionary algorithm,lower bound,high quality result,branch and bound
Branch and bound,Mathematical optimization,Hybrid algorithm,Evolutionary algorithm,Computer science,Upper and lower bounds,Algorithm,Continuous knapsack problem,Knapsack problem,Genetic algorithm,Search tree
Conference
Volume
ISSN
ISBN
3562
0302-9743
3-540-26319-5
Citations 
PageRank 
References 
9
0.52
13
Authors
3
Name
Order
Citations
PageRank
José E. Gallardo1576.99
Carlos Cotta244136.10
Antonio Fernández380149.47