-
Article
Open AccessSearch graph structure and its implications for multi-graph constrained routing and scheduling problems
Multi-graphs where several edges connect a pair of nodes are an important modelling approach for many real-world optimisation problems. The multi-graph structure is often based on infrastructure and available ...
-
Article
Open AccessA systematic approach to parameter optimization and its application to flight schedule simulation software
Industrial software often has many parameters that critically impact performance. Frequently, these are left in a sub-optimal configuration for a given application because searching over possible configuration...
-
Article
Open AccessPreface: The practice and theory of automated timetabling (2018)
-
Article
The practice and theory of automated timetabling (2016)
-
Chapter
A Classification of Hyper-Heuristic Approaches: Revisited
Hyper-heuristics comprise a set of approaches that aim to automate the development of computational search methodologies. This chapter overviews previous categorisations of hyper-heuristics and provides a unif...
-
Reference Work Entry In depth
Hyper-heuristics
This chapter presents a literature review of the main advances in the field of hyper-heuristics, since the publication of a survey paper in 2013. The chapter demonstrates the most recent advances in hyper-heur...
-
Chapter and Conference Paper
Late Acceptance Hill Climbing for Constrained Covering Arrays
The Late Acceptance Hill-Climbing (LAHC) algorithm is a one-point search meta-heuristic with a single parameter. Like Simulated Annealing (SA) it sometimes accepts worsening moves, however it is far more simpl...
-
Living Reference Work Entry In depth
Hyper-heuristics
This chapter presents a literature review of the main advances in the field of hyper-heuristics, since the publication of a survey paper in 2013. The chapter demonstrates the most recent advances in hyper-heur...
-
Article
Preface
-
Chapter and Conference Paper
An Iterated Local Search Framework with Adaptive Operator Selection for Nurse Rostering
Considerable attention has been paid to selective hyper-heuristic frameworks for addressing computationally hard scheduling problems. By using selective hyper-heuristics, we can derive benefits from the streng...
-
Article
The Practice and Theory of Automated Timetabling (2012)
-
Chapter and Conference Paper
The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration
We use the Local Optima Network model to study the structure of symmetric TSP fitness landscapes. The ‘big-valley’ hypothesis holds that for TSP and other combinatorial problems, local optima are not randomly ...
-
Article
Comments on: An overview of curriculum-based course timetabling
-
Article
On parallel local search for permutations
We investigate some ways in which massively parallel computing devices can be exploited in local search algorithms. We show that the substantial speedups that can be gained from parallel neighbourhood evaluati...
-
Article
Journal of Scheduling (2015)
-
Chapter and Conference Paper
Modified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem
Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work...
-
Article
An analysis of constructive algorithms for the airport baggage sorting station assignment problem
The assignment of airport resources can significantly affect the quality of service provided by airlines and airports. High quality assignments can support airlines and airports in adhering to published schedu...
-
Article
A more realistic approach for airport ground movement optimisation with stand holding
In addition to having to handle constantly increasing numbers of aircraft, modern airports also have to address a wide range of environmental regulations and requirements. As airports work closer and closer to...
-
Article
Open AccessUnified encoding for hyper-heuristics with application to bioinformatics
This paper introduces a new approach to applying hyper-heuristic algorithms to solve combinatorial problems with less effort, taking into account the modelling and algorithm construction process. We propose a ...
-
Article
The practice and theory of automated timetabling