Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics

  • No Author Given
  • Published 2003


The idea underlying hyper-heuristics is to discover some combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be worthwhile, such a combination should outperform all of the constituent heuristics. In this paper we describe a novel messy-GA-based approach that learns such a heuristic combination for… (More)


4 Figures and Tables

Slides referencing similar topics