[PDF] Top 20 A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems

... VNS algorithm to improve the quality of the obtained solution and diversify the search process at the same ...Local Search framework for generating an initial solution and employed VNS and CP in ... See full document

... a hybrid method combining Variable Neighbourhood Search and In- teger Programming techniques ...to solve modern Nurse Rostering ...proposed hybrid algorithm ... See full document

... medium-sized problems, IP solvers are often efficient to find the optimal solution and to generate strong lower ...large-scale problems, or even small-scale problems with a highly-constrained ... See full document

... adaptive variable neighborhood search (AVNS) to deal with this ...Two problems were considered as special cases of VRPIS namely the GVRP and the electric VRP with recharging facilities ...a ... See full document

... these problems, but they usually need more computational time, though they don’t really need good initial guesses and deterministic ...to solve optimal control ...to solve discrete time optimal ... See full document

... optimization algorithm for multi-objective mathematical ...local search, honeybee decision making, and multi-agent particle environment ...a hybrid-harmony search algorithm with hill ... See full document

... and Integer Programming methods to solve a NRP with up to 100 nurses and approximately 13 hard and soft ...individual nurse schedules are created by using a single or double shift swapping ... See full document

... over-constrained problems [9, 10]. They are very difficult to solve manually due to their nature of large number of often conflicting objectives that must be taken into consideration while constructing the ... See full document

... the search process. Here, we only call the pre-solve step of an IP solver from the hybrid algorithm as a ...to solve the problem, otherwise we will use the CP solver ...the ... See full document

... the algorithm by hybridization of the metaheuristic ap- proach with mathematical ...exactly solve defined ...of problems as stand-alone solution ...branch-and-cut algorithm incorporated in ... See full document

... International Nurse Rostering Competition (INRC-I) ...proposed hybrid algorithm. In Section 6, we benchmark the algorithm by using two different datasets including the instances ... See full document

... bound algorithm. Here, we only call the pre-solve step of an IP solver from the hybrid algorithm as a ...the integer constraints), the employed IP solver might be able to solve ... See full document

... normally distributed random variable ε is illustrated in Figure 1 (more details of this instance will be given in section & 3.1). Thus, the problem belongs to global (nonlinear) optimization area, and may have ... See full document

... The Q-learning function, presented in Eq (1), is applied to tackle the local phase problem. The aim is to update the value of S when changes are made by the selected a. In this multi-stage nurse rostering ... See full document

... (Hybrid Algorithm Based on Memetic Algorithm and Tabu Search: HMATS), three state-of-the- art existing algorithms were also ...a Hybrid algorithm (Hybr.K) based on the Tabu ... See full document

... the algorithm is trying to improve the solution to the feasible ...the algorithm repeats the search process by decreasing the total number of ...The algorithm stops when the maximum execution ... See full document

... all integer constraints are ...pure integer programming prob- lem can be solved in a finite number of ...the integer solutions obtained by each cut becomes very ... See full document

... A key-node is a Steiner node with degree of 3 at the lowest. A key-path is one with all intermediate vertices (not be terminal vertex) with degree 2, the first and the last vertex of that path or belong to a set of ... See full document

... routing problems while still har- nessing the power of exact ...size problems for which finding the overall optimal solu- tion requires too much computation ... See full document

... Bilevel programming has been proposed for dealing with decision processes involving two decision makers with a hierarchical ...bilevel programming problem (BLPP) consists of two levels, namely, the first ... See full document