Α two-phase adaptive variable neighborhood approach for nurse rostering |
| |
| Affiliation: | 1. Department of Control Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Technická 2, 166 27 Prague 6, Czech Republic;2. Industrial Informatics Group, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Jugoslávských partyzánů 1580/3, 160 00 Prague 6, Czech Republic;1. Department of Industrial Engineering, TED University, Ankara, Turkey;2. School of Management, University of Bath, Bath, United Kingdom;1. Department of Technology, Management and Economics, Technical University of Denmark, Anker Engelundsvej 1, Kgs. Lyngby 2800, Denmark;2. KU Leuven, Department of Computer Science, CODeS, Gebroeders De Smetstraat 1, Gent 9000, Belgium |
| |
| Abstract: | This contribution presents a two-phase variable neighborhood search algorithm for solving nurse rostering problems. In order to demonstrate the efficiency of the proposed algorithm, it is firstly applied to all nurse rostering problem instances as proposed in the First International Nurse Rostering Competition (INRC-2010). Computational results assessed on all three sets of sixty competition instances demonstrate that the proposed algorithm improves the best known results for two instances, inside the time limits of the competition, while achieving the best known bounds for forty eight other instances. The proposed algorithm was also applied to seven other nurse rostering instances reported in the respective literature and managed to achieve the best known result in six of them while improving the best known result in one instance. The proposed algorithm, as well as its differences from existing approaches are presented, described and discussed in detail. |
| |
| Keywords: | Nurse rostering Hospital personnel scheduling Variable neighborhood Two-phase algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
