Introduction to Hyper-Heuristics

Abstract

Research into solving combinatorial optimization problems such as timetabling, vehicle routing and rostering problems has involved deriving techniques that improve the results obtained by existing techniques for known benchmark sets. These benchmark sets are made publicly available for performance comparisons of different techniques in solving these problems. This research has revealed that while a technique may produce the best results for one or two problem instances, quite often it performs poorly on other problem instances.