A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems

Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatible though. In this paper, we consider a hybrid model that combines these two techniques. To be precise, it is based on the interleaved execution of both approaches, and has a heuristic nature. The multidimensional 0-1 knapsack problem has been chosen as benchmark. As it will be shown, the hybrid algorithm can produce better results at the same computational cost, specially for larger problem instances.

• Type: Conference
• Year: 2005
• Where: CEC
• Authors: José E. Gallardo, Carlos Cotta, Antonio J. Fernández
• Keywords: 0-1 Knapsack Problem, Artificial Intelligence, CEC 2005, Combinatorial Optimization Problems, Larger Problem Instances