Results 1 to 10 of about 1,116,663 (238)
Recent advances in selection hyper-heuristics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmed Kheiri +2 more
exaly +6 more sources
A generality analysis of multiobjective hyper-heuristics
Selection hyper-heuristics have emerged as high level general-purpose search methodologies that mix and control a set of low-level (meta) heuristics. Previous empirical studies over a range of single objective optimisation problems have shown that the ...
Wenwen Li +2 more
exaly +6 more sources
A review of reinforcement learning based hyper-heuristics [PDF]
The reinforcement learning based hyper-heuristics (RL-HH) is a popular trend in the field of optimization. RL-HH combines the global search ability of hyper-heuristics (HH) with the learning ability of reinforcement learning (RL). This synergy allows the
Cuixia Li +4 more
doaj +3 more sources
As exact algorithms are unfeasible to solve real optimization problems, due to their computational complexity, meta-heuristics are usually used to solve them.
Vinicius Renan DE CARVALHO +2 more
exaly +3 more sources
Hyper-heuristics for personnel scheduling domains
In real-life applications problems can frequently change or require small adaptations. Manually creating and tuning algorithms for different problem domains or different versions of a problem can be cumbersome and time-consuming. In this paper we consider several important problems with high practical relevance, which are Bus Driver Scheduling ...
Lucas Kletzander, Nysret Musliu
core +4 more sources
Hyper-heuristics: a survey of the state of the art [PDF]
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more generally applicable search methodologies.
Edmund K. Burke +6 more
openaire +6 more sources
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is to determine the best approach for solving a problem at its current state. This way, every time we make a move it gets us closer to a solution.
Melissa Sanchez +2 more
exaly +3 more sources
Hyper-heuristics: A survey and taxonomy
Hyper-heuristics are search techniques for selecting, generating, and sequencing (meta)-heuristics to solve challenging optimization problems. They differ from traditional (meta)-heuristics methods, which primarily employ search space-based optimization strategies.
Tansel Dokeroglu +2 more
exaly +3 more sources
Selection hyper-heuristics in dynamic environments [PDF]
Current state-of-the-art methodologies are mostly developed for stationary optimization problems. However, many real-world problems are dynamic in nature, where different types of changes may occur over time. Population-based approaches, such as evolutionary algorithms, are frequently used for solving dynamic environment problems.
Berna Kiraz +2 more
openaire +3 more sources
Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems
Hyper-heuristics (HHs) stand as a relatively recent approach to solving optimization problems. There are different kinds of HHs. One of them deals with how low-level heuristics must be combined to deliver an improved solution to a set of problem ...
Alonso Vela +3 more
doaj +2 more sources

