Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound
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.
KeywordsGenetic Algorithm Evolutionary Algorithm Search Tree Hybrid Algorithm Knapsack Problem
Unable to display preview. Download preview PDF.
- 4.Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)Google Scholar
- 10.Cotta, C., Troya, J.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In Smith, G., Steele, N., Albrecht, R., eds.: Artificial Neural Nets and Genetic Algorithms 3, Wien New York, Springer-Verlag (1998) 251–255Google Scholar
- 13.Raidl, G., Gottlieb, J.: Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. Technical Report TR 186–1–04–05, Institute of Computer Graphics and Algorithms, Vienna University of Technology (2004)Google Scholar
- 14.Cotta, C., Aldana, J.F., Nebro, A.J., Troya, J.M.: Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP. In: Pearson, D.W., Steele, N.C., Albrecht, R.F. (eds.) Artificial Neural Nets and Genetic Algorithms 2, Wien, New York, pp. 277–280. Springer, Heidelberg (1995)Google Scholar
- 19.Beasley, J.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41, 1069–1072 (1990)Google Scholar