Hyper-heuristics: A survey of the state of the art
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 …
goal of automating the design of heuristic methods to solve hard computational search …
An efficient harris hawk optimization algorithm for solving the travelling salesman problem
FS Gharehchopogh, B Abdollahzadeh - Cluster Computing, 2022 - Springer
Abstract Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
Hyper-heuristics: An emerging direction in modern search technology
This chapter introduces and overviews an emerging methodology in search and
optimisation. One of the key aims of these new approaches, which have been termed …
optimisation. One of the key aims of these new approaches, which have been termed …
An artificial bee colony algorithm with a modified choice function for the traveling salesman problem
Abstract The Artificial Bee Colony (ABC) algorithm is a swarm intelligence approach which
has initially been proposed to solve optimisation of mathematical test functions with a unique …
has initially been proposed to solve optimisation of mathematical test functions with a unique …
Hyperheuristics: recent developments
K Chakhlevitch, P Cowling - Adaptive and multilevel metaheuristics, 2008 - Springer
Given their economic importance, there is continuing research interest in providing better
and better solutions to real-world scheduling problems. The models for such problems are …
and better solutions to real-world scheduling problems. The models for such problems are …
[PDF][PDF] An Improved Farmland Fertility Algorithm with Hyper-Heuristic Approach for Solving Travelling Salesman Problem.
FS Gharehchopogh, B Abdollahzadeh… - … -Computer Modeling in …, 2023 - researchgate.net
ABSTRACT Travelling Salesman Problem (TSP) is a discrete hybrid optimization problem
considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city …
considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city …
Choosing search heuristics by non-stationary reinforcement learning
MGC Resende, JP de Sousa, A Nareyek - … : Computer decision-making, 2004 - Springer
Search decisions are often made using heuristic methods because real-world applications
can rarely be tackled without any heuristics. In many cases, multiple heuristics can …
can rarely be tackled without any heuristics. In many cases, multiple heuristics can …
A reinforcement learning: great-deluge hyper-heuristic for examination timetabling
Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem
This paper investigates a genetic algorithm based hyperheuristic (hyper-GA) for scheduling
geographically distributed training staff and courses. The aim of the hyper-GA is to evolve a …
geographically distributed training staff and courses. The aim of the hyper-GA is to evolve a …
Parallel hyper heuristic algorithm based on reinforcement learning for the corridor allocation problem and parallel row ordering problem
Hyper heuristics is a relatively new optimisation algorithm. Numerous studies have reported
that hyper heuristics are well applied in combinatorial optimisation problems. As a classic …
that hyper heuristics are well applied in combinatorial optimisation problems. As a classic …