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

DOI10.1016/J.EJOR.2017.01.042MaRDI QIDQ1753518zbMATH OpenOpenAlexFDO

Authors Jorge A. Soria-Alcaraz, Gabriela Ochoa, Marco A. Sotelo-Figeroa, Edmund K. 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

adaptive searchcombinatorial optimizationhyper-heuristicsiterated local searchmetaheuristics

Mathematics Subject Classification ID

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

Recommendations

• Evolutionary Computation in Combinatorial Optimization
• Recent advances in selection hyper-heuristics
• An iterated multi-stage selection hyper-heuristic
• Dynamic Heuristic Set Selection for Cross-Domain Selection Hyper-heuristics
• Principles and Practice of Constraint Programming – CP 2004

Cites work

• A graph-based hyper-heuristic for educational timetabling problems
• A review of dynamic vehicle routing problems
• A survey of school timetabling research
• A survey of search methodologies and automated system development for examination timetabling
• A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
• Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
• Adaptive selection of heuristics for improving exam timetables
• Adaptive tabu search for course timetabling
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• Analyzing bandit-based adaptive operator selection mechanisms
• Effective learning hyper-heuristics for the course timetabling problem
• Evolutionary Computation in Combinatorial Optimization
• Finite-time analysis of the multiarmed bandit problem
• Handbook of metaheuristics
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Hybrid variable neighbourhood approaches to university exam timetabling
• HyFlex: a benchmark framework for cross-domain heuristic search
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Measuring instance difficulty for combinatorial optimization problems
• Paramils: an automatic algorithm configuration framework
• Tuning metaheuristics. A machine learning Perspective

Cited in

(7)

• An ensemble approach with external archive for multi- and many-objective optimization with adaptive mating mechanism and two-level environmental selection
• Recent advances in selection hyper-heuristics
• Metaheuristics ``In the large
• Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects
• Evolutionary Computation in Combinatorial Optimization
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
• Dynamic Heuristic Set Selection for Cross-Domain Selection Hyper-heuristics

Describes a project that uses

Uses Software

• HyFlex
• Hyperheuristics
• Paramils

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753518)