In this paper, we are addressing the NP-hard nurse rostering problem utilizing a 2-stage approach. stage one, Monte Carlo Tree Search (MCTS) and Hill Climbing (HC) hybridized in finding feasible solution (satisfying all hard constraints). We propose new constant C value (which balances search diversification intensification of MCTS) tree policy/node selection function procedure MCTS. two...

Hyper-heuristics are high level improvement search methodologies exploring space of heuristics [4]. According to [5], hyper-heuristics can be categorized in many ways. A hyper-heuristic either selects from a set of available low level heuristics or generates new heuristics from components of existing low level heuristics to solve a problem, leading to a distinction between selection and generat...

This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those that are sequence related, those that are nurse schedule related and those that are roster related. We propose a decomposition approach to construct solutions that consists of two stages: 1) to construct high quality s...

In this thesis a novel Case-Based Reasoning (CBR) system called CABAROST (CAsedBAsed ROSTering) for a complex, real-world, personnel rostering problem is presented. CBR is an artificial intelligence paradigm which attempts to solve new problems using information about the solution to previously encountered problems. CBR is used to capture and store examples of expert rostering behaviour which a...

In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...

Design and development of robust and reliable scheduling algorithms has been an active research area in Computer Science and Artificial Intelligence. Given that the general problem is computationally intractable, many heuristic-based techniques have been developed, while other approaches have used optimising techniques for specific and limited problem domains. In this paper, we consider a large...