Genetic Programming for Guiding Branch and Bound Search

Abstract

We propose how Genetic Programming (GP) can be used for developing, in real time, problem-specific heuristics for Branch and Bound (B&B) search. A GP run, embedded into the B&B process, exploits the characteristics of the particular problem being solved, evolving a problem-specific heuristic expression. The evolved heuristic replaces the default one for the… (More)

6 Figures and Tables

Topics

  • Presentations referencing similar topics