Recent advances in selection hyper-heuristics
From MaRDI portal
Publication:2183846
DOI10.1016/j.ejor.2019.07.073zbMath1441.90183WikidataQ127401267 ScholiaQ127401267MaRDI QIDQ2183846
John H. Drake, Ahmed Kheiri, Ender Özcan, Edmund Kieran Burke
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.073
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems, A review of mathematical optimization models applied to the sugarcane supply chain, Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge, Hyper-heuristic for integrated due-window scheduling and vehicle routing problem for perishable products considering production quality, On the class of hybrid adaptive evolutionary algorithms (\textsc{chavela}), Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring, A framework for inherently interpretable optimization models, Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling, Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling, Interval type-2 fuzzy sets improved by simulated annealing for locating the electric charging stations, A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties, Metaheuristics ``In the large, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning, A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem, Selection hyper-heuristics for the multi and many-objective quadratic assignment problem, When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A review of hyper-heuristics for educational timetabling
- GOAL solver: a hybrid local search based solver for high school timetabling
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- Effective learning hyper-heuristics for the course timetabling problem
- Unified encoding for hyper-heuristics with application to bioinformatics
- Decomposition based hybrid metaheuristics
- An iterated multi-stage selection hyper-heuristic
- Adaptive selection of heuristics for improving exam timetables
- Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
- A general heuristic for vehicle routing problems
- Variable neighbourhood search: methods and applications
- Solving urban transit route design problem using selection hyper-heuristics
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways
- The late acceptance hill-climbing heuristic
- Joint optimization models for shelf display and inventory control considering the impact of spatial relationship on demand
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- Markov chain methods for the bipartite Boolean quadratic programming problem
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
- Automatically improving the anytime behaviour of optimisation algorithms
- A graph-based hyper-heuristic for educational timetabling problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
- Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm
- Exploring Hyper-heuristic Methodologies with Genetic Programming
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- A runtime analysis of simple hyper-heuristics
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
