A time predefined variable depth search for nurse rostering

QR Code

A time predefined variable depth search for nurse rostering

This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as...

Full description

Bibliographic Details
Main Authors:	Burke, Edmund, Curtois, Tim, Qu, Rong, Vanden Berghe, Greet
Format:	Article
Published:	INFORMS 2013
Subjects:	Timetabling personnel local search heuristics
Online Access:	https://eprints.nottingham.ac.uk/28283/

Similar Items

Hybridizations within a graph based hyper-heuristic framework for university timetabling problems
by: Qu, Rong, et al.
Published: (2008)

Similarity Measures for Exam Timetabling Problems
by: Burke, Edmund, et al.
Published: (2003)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A stochastic local search algorithm with adaptive acceptance for high-school timetabling
by: Kheiri, Ahmed, et al.
Published: (2014)

A hybrid evolutionary approach to the nurse rostering problem
by: Bai, Ruibin, et al.
Published: (2010)

Case Based Heuristic Selection for Timetabling Problems
by: Burke, Edmund, et al.
Published: (2006)

Case Based Heuristic Selection for Timetabling Problems
by: Burke, Edmund, et al.
Published: (2006)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

Non-linear great deluge with reinforcement learning for university course timetabling
by: Obit, Joe Henry, et al.
Published: (2011)

A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
by: Brucker, Peter, et al.
Published: (2005)

Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
by: Burke, Edmund, et al.
Published: (2005)

A component based heuristic search method with evolutionary eliminations for hospital personnel scheduling
by: Li, Jingpeng, et al.
Published: (2008)

A tensor based hyper-heuristic for nurse rostering
by: Asta, Shahriar, et al.
Published: (2016)

Iterated local search using an add and delete hyper- heuristic for university course timetabling
by: Soria-Alcaraz, Jorge A., et al.
Published: (2016)

Fuzzy methodologies for automated University timetabling solution construction and evaluation
by: Asmuni, Hishammuddin
Published: (2008)

Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems
by: Burke, Edmund, et al.
Published: (2005)

A constructive approach to examination timetabling based on adaptive decomposition and ordering
by: Abdul-Rahman, Syariza, et al.
Published: (2014)

An investigation of Monte Carlo tree search and local search for course timetabling problems
by: Goh, Say Leng
Published: (2017)

Multiple-retrieval case-based reasoning for course timetabling problems
by: Burke, Edmund, et al.
Published: (2006)

Hyper-heuristics and fairness in examination timetabling problems
by: Muklason, Ahmad
Published: (2017)

Analysing Similarity in Exam Timetabling
by: Burke, Edmund, et al.
Published: (2004)

High school timetabling using selection hyperheuristics
by: Nasir Ahmed, Leena Hassan
Published: (2014)

Improved local search approaches to solve the post enrolment course timetabling problem
by: Goh, Say Leng, et al.
Published: (2017)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

A survey of search methodologies and automated system development for examination timetabling
by: Qu, Rong, et al.
Published: (2008)

Development and application of hyperheuristics to personnel scheduling
by: Soubeiga, Eric
Published: (2003)

A harmony search algorithm for nurse rostering problems
by: Hadwan, Mohammed, et al.
Published: (2013)

A variable neighbourhood search for the workforce scheduling and routing problem
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2015)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)

Comparing hybrid constructive heuristics for university course timetabling
by: Landa-Silva, Dario, et al.
Published: (2011)

The automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems
by: Sabar, Nasar, et al.
Published: (2014)

A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems
by: Sabar, Nasar R., et al.
Published: (2015)

Metaheuristic and Multiobjective Approaches for Space Allocation
by: Landa Silva, Jesus Dario
Published: (2003)

Automated generation of constructive ordering heuristics for educational timetabling
by: Pillay, Nelishia, et al.
Published: (2017)

Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem
by: Asta, Shahriar, et al.
Published: (2016)

'Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem'
by: Aickelin, Uwe, et al.
Published: (2000)

Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
by: Aickelin, Uwe, et al.
Published: (2000)

'Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem'
by: Aickelin, Uwe, et al.
Published: (2000)