A review of hyper-heuristics for educational timetabling
N Pillay - Annals of Operations Research, 2016 - Springer
Educational timetabling problems, namely, university examination timetabling, university
course timetabling and school timetabling, are combinatorial optimization problems …
course timetabling and school timetabling, are combinatorial optimization problems …
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 …
Semiconductor final testing scheduling using Q-learning based hyper-heuristic
J Lin, YY Li, HB Song - Expert Systems with Applications, 2022 - Elsevier
Semiconductor final testing scheduling problem (SFTSP) has extensively been studied in
advanced manufacturing and intelligent scheduling fields. This paper presents a Q-learning …
advanced manufacturing and intelligent scheduling fields. This paper presents a Q-learning …
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 …
Solving urban transit route design problem using selection hyper-heuristics
The urban transit routing problem (UTRP) focuses on finding efficient travelling routes for
vehicles in a public transportation system. It is one of the most significant problems faced by …
vehicles in a public transportation system. It is one of the most significant problems faced by …
Automatic design of hyper-heuristic based on reinforcement learning
Hyper-heuristic is a class of methodologies which automates the process of selecting or
generating a set of heuristics to solve various optimization problems. A traditional hyper …
generating a set of heuristics to solve various optimization problems. A traditional hyper …
Solving the high school timetabling problem using a hybrid cat swarm optimization based algorithm
In this contribution we present the application of a hybrid cat swarm optimization (CSO)
based algorithm for solving the school timetabling problem. This easy to use, efficient and …
based algorithm for solving the school timetabling problem. This easy to use, efficient and …
A unified hyper-heuristic framework for solving bin packing problems
One-and two-dimensional packing and cutting problems occur in many commercial contexts,
and it is often important to be able to get good-quality solutions quickly. Fairly simple …
and it is often important to be able to get good-quality solutions quickly. Fairly simple …
Solving high school timetabling problems worldwide using selection hyper-heuristics
High school timetabling is one of those recurring NP-hard real-world combinatorial
optimisation problems that has to be dealt with by many educational institutions periodically …
optimisation problems that has to be dealt with by many educational institutions periodically …
Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
This paper first introduces the fundamental principles of immune algorithm (IA), greedy
algorithm (GA) and delete-cross operator (DO). Based on these basic algorithms, a hybrid …
algorithm (GA) and delete-cross operator (DO). Based on these basic algorithms, a hybrid …