A methodology for determining an effective subset of heuristics in selection hyper-heuristics

DOI10.1016/j.ejor.2017.01.042zbMath1403.90658OpenAlexW2580414719MaRDI QIDQ1753518

Gabriela Ochoa, Jorge A. Soria-Alcaraz, Marco A. Sotelo-Figeroa, Edmund Kieran Burke

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://dspace.stir.ac.uk/bitstream/1893/24924/1/EJORMethodologySelHH2017%20%281%29.pdf

zbMATH Keywords

combinatorial optimizationmetaheuristicsiterated local searchhyper-heuristicsadaptive search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

An ensemble approach with external archive for multi- and many-objective optimization with adaptive mating mechanism and two-level environmental selection ⋮ Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects ⋮ Recent advances in selection hyper-heuristics ⋮ Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems ⋮ Metaheuristics ``In the large

Uses Software

• Hyperheuristics
• Paramils
• HyFlex

Cites Work

• Unnamed Item
• Effective learning hyper-heuristics for the course timetabling problem
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• Adaptive selection of heuristics for improving exam timetables
• A survey of school timetabling research
• Analyzing bandit-based adaptive operator selection mechanisms
• A survey of search methodologies and automated system development for examination timetabling
• Hybrid variable neighbourhood approaches to university exam timetabling
• Tuning metaheuristics. A machine learning Perspective
• Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
• Local search and constraint programming for the post enrolment-based course timetabling problem
• A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
• Measuring instance difficulty for combinatorial optimization problems
• A review of dynamic vehicle routing problems
• Adaptive tabu search for course timetabling
• A graph-based hyper-heuristic for educational timetabling problems
• HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
• ParamILS: An Automatic Algorithm Configuration Framework
• Evolutionary Computation in Combinatorial Optimization
• Handbook of metaheuristics
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: A methodology for determining an effective subset of heuristics in selection hyper-heuristics