HIGH-LEVEL SEARCH: FROM HYPER- HEURISTICS TO ALGORITHM SELECTION MUSTAFA MISIR
HIGH-LEVEL SEARCH • Instead of directly solving a High-level Search Methods given probem (~instance), Operates upon perform a search on algorithm space Low-level Algorithms Operates upon • Generic (Problem- Independent) Methods Potential Solutions
HIGH-LEVEL SEARCH • Can be performed: - ONLINE : while solving a problem instance - OFFLINE : before solving a problem instance
ONLINE
A GENERIC INTELLIGENT Mustafa MISIR Patrick De CAUSMAECKER HYPER-HEURISTIC Greet VANDEN BERGHE Katja VERBEECK
OUTLINE OBJECTIVE HYPER-HEURISTICS A GENERIC INTELLIGENT HH ( GIHH ) COMPUTATIONAL RESULTS
OUTLINE OBJECTIVE HYPER-HEURISTICS A GENERIC INTELLIGENT HH ( GIHH ) COMPUTATIONAL RESULTS
OBJECTIVE Designing a generic problem solver for solving all kinds of search and optimisation problems under different conditions
OUTLINE OBJECTIVE HYPER-HEURISTICS A GENERIC INTELLIGENT HH ( GIHH ) COMPUTATIONAL RESULTS
HYPER-HEURISTICS | DEFINITION Burke et al. (2009) : “A hyper-heuristic is a search method or learning mechanism for selecting or generating heuristics to solve computational search problems”
OUTLINE OBJECTIVE HYPER-HEURISTICS A GENERIC INTELLIGENT HH ( GIHH ) COMPUTATIONAL RESULTS
ADAPTIVE DYNAMIC HEURISTIC SET Use an elite subset of a given heuristic set During different parts of a search process (based on the heuristics’ performance )
MOVE ACCEPTANCE + RE-INITIALISATION Adaptive iterion limited list-based threshold accepting If doesn’t work, re-initialise
OUTLINE OBJECTIVE HYPER-HEURISTICS A GENERIC INTELLIGENT HH ( GIHH ) COMPUTATIONAL RESULTS
COMPUTATIONAL RESULTS HyFlex: Hyper-heuristic software framework (Uni. Nottingham) 6 problem domains Different algorithm (heuristic) sets GIHH Open source @ http://allserv.kahosl.be/~mustafa.misir/gihh.html
COMPUTATIONAL RESULTS | CHESC 2011 CHeSC 2011 WINNER ! Best algorithm on average across 6 problem domains with a large score margin Againist 19 competitors
DISCUSSION • A generic high-level search tool • GIHH as the CHeSC 2011 Winner • Robust, easily applicable (generic) • Goal: combine offline and online
Recommend
More recommend