Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem

QR Code

Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem

An approximate dynamic programming that incorporates a combined policy, value function approximation and lookahead policy, is proposed. The algorithm is validated by applying it to solve a set of instances of the nurse rostering problem tackled as a multi-stage problem. In each stage of the problem,...

Full description

Bibliographic Details
Main Authors:	Shi, Peng, Landa-Silva, Dario
Format:	Conference or Workshop Item
Published:	2017
Online Access:	https://eprints.nottingham.ac.uk/48603/

Similar Items

Lookahead policy and genetic algorithm for solving nurse rostering problems
by: Shi, Peng, et al.
Published: (2018)

Dynamic programming with approximation function for nurse scheduling
by: Shi, Peng, et al.
Published: (2016)

A hybrid optimization method in solving nurse duty roster problem
by: Ng, Jian Qin
Published: (2017)

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

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

Nurse Rostering with Genetic Algorithms
by: Aickelin, Uwe
Published: (1998)

'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)

Evolutionary local search for solving the office space allocation problem
by: Ulker, Ozgur, et al.
Published: (2012)

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

A time predefined variable depth search for nurse rostering
by: Burke, Edmund, et al.
Published: (2013)

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

Adaptive multiple crossover genetic algorithm to solve Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2018)

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

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)

An evolutionary non-Linear great deluge approach for solving course timetabling problems
by: Obit, Joe Henry, et al.
Published: (2012)

Using goal programming on estimated Pareto fronts to solve multiobjective problems
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2018)

Multi-start methods for the capacitated clustering problem
by: Martinez-Gavara, Anna, et al.
Published: (2017)

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

Improved dynamic lexicographic ordering for multi-objective optimisation
by: Castro-Gutierrez, Juan, et al.
Published: (2010)

A study of genetic operators for the Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2015)

An adaptive evolutionary multi-objective approach based on simulated annealing
by: Li, Hui, et al.
Published: (2011)

Designing difficult office space allocation problem instances with mathematical programming
by: Ulker, Ozgur, et al.
Published: (2011)

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm
by: Constantino, Ademir Aparecido, et al.
Published: (2017)

A 0/1 integer programming model for the office space allocation problem
by: Ulker, Ozgr, et al.
Published: (2010)

Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem
by: Algethami, Haneen, et al.
Published: (2017)

Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems
by: Al-Nemrat, Asem Mustafa Moh’ad
Published: (2019)

Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems
by: Al-Nemrat, Asem Mustafa Moh’ad
Published: (2019)

A new weighting scheme and discriminative approach for information retrieval in static and dynamic document collections
by: Ibrahim, Osman A. S., et al.
Published: (2014)

Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
by: Li, Hui, et al.
Published: (2010)

Explicit schemes based on rational approximant for solving first order initial value problems
by: A’in Nazifa Fairuz,, et al.
Published: (2020)

Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm
by: Khoo, Thau Soon
Published: (2022)

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

A Genetic Algorithm for a Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2016)

An agent based modelling approach for the office space allocation problem
by: Dediu, Alexandra, et al.
Published: (2018)

Computational study for workforce scheduling and routing problems
by: Castillo-Salazar, J. Arturo, et al.
Published: (2014)

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

Hybrid heuristic for multi-carrier transportation plans
by: Landa-Silva, Dario, et al.
Published: (2011)