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.

[1]  Carlos Cotta,et al.  Embedding Branch and Bound within Evolutionary Algorithms , 2003, Applied Intelligence.

[2]  Joseph C. Culberson,et al.  On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.

[3]  Harvey M. Salkin,et al.  Foundations of integer programming , 1989 .

[4]  Carlos Cotta,et al.  Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP , 1995, ICANNGA.

[5]  Jens Gottlieb,et al.  Permutation-based evolutionary algorithms for multidimensional knapsack problems , 2000, SAC '00.

[6]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[7]  Paul Jung,et al.  No free lunch. , 2002, Health affairs.

[8]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[9]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[10]  Günther R. Raidl,et al.  Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem , 2005, Evolutionary Computation.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  John M. Wilson,et al.  Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems , 2001, J. Heuristics.

[13]  Thomas Bäck,et al.  The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[14]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[15]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[16]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[17]  Carlos Cotta,et al.  A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem , 1997, ICANNGA.

[18]  Rudolf F. Albrecht,et al.  Artificial Neural Nets and Genetic Algorithms , 1995, Springer Vienna.

[19]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[20]  Sunderesh S. Heragu,et al.  A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem , 1996, Ann. Oper. Res..

[21]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[22]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[23]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .