A 2-Stage Approach for the Nurse Rostering Problem

Abstract

In this paper, we are addressing the NP-hard nurse rostering problem utilizing a 2-stage approach. In stage one, Monte Carlo Tree Search (MCTS) and Hill Climbing (HC) are hybridized in finding a feasible solution (satisfying all the hard constraints). We propose a new constant C value (which balances search diversification and intensification of MCTS) and tree policy/node selection function in the selection procedure of MCTS. In stage two, the feasible solution is further improved using Iterated Local Search (ILS) with Variable Neighbourhood Descent as the local search component. We introduce several unique neighbourhood structures for the ILS. In addition, we propose a novel perturbation strategy to allow the search to escape from local optimum. The proposed methodology is tested on the Shift Scheduling dataset (24 benchmark instances). New best results are reported for seven and two instances for the 10 and 60 minutes run respectively. An in-depth discussion on the attributes of the proposed methodology that lead to its good performance is provided.INDEX TERMS nurse rostering, hill climbing, monte carlo tree search, iterated local search, variable neighbourhood descent.

Portfolio Optimization Problem: A Taxonomic Review of Solution Methodologies

“…[34] Istanbul Stock Exchange (ISE) 30 2,3 -Monthly returns of 21 assets from January 2005 to November 2016.…”

“…2 https://datastore.borsaistanbul.com/ Last accessed: November 1, 2022. 3 https://tr.investing.com/ Last accessed: November 1, 2022. 4 https://www.cmie.com/ Last accessed: November 1, 2022.…”

“…Diversifying the portfolio is common among investors to maximize the expected return while minimizing the risk [2]. The Portfolio Optimisation Problem (POP) is one type of combinatorial optimisation problems (COPs) [3] [4] [5]. It involves assigning resources to a limited number of assets, which seeks an equilibrium between risk and return.…”

Research on the assignment of elderly care service personnel with time window constraints

“…This approach enhances the efficiency of solving optimization issues on a large scale, enables the efficient retrieval of the optimal value, and tackles the gate assignment problem. The nurse scheduling issue was resolved by S. Captain [ 45 ] using a two-stage technique. He used a hybrid Monte-Carlo tree search technique with a hierarchical clustering algorithm to identify and apply a workable and ideal solution.…”

An Improved Discrete Grey Wolf Optimizer for the Nurse Rostering Problem

“…Combinatorial optimization problems (COP), which include vehicle routing [1,2], traveling salesman [3], high school timetabling [4], personnel scheduling [5,6] and job shop scheduling [7,8] have had many approaches (both exact and approximate) proposed to address them. The Nurse Rostering Problem (NRP) or Nurse Scheduling Problem (NSP) was introduced by Warner [9] and Miller et.…”