Ant colony optimization with semi random initialization for nurse rostering problem
A nurse rostering problem is an NP-Hard problem that is difficult to solve during the complexity of the problem. Since good scheduling is the schedule that fulfilled the hard constraint and minimizes the violation of soft constraint, a lot of approaches is implemented to improve the quality of the s...
Main Authors: | Achmad Said, Wibowo Antoni, Diana Diana |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2021-01-01
|
Series: | International Journal for Simulation and Multidisciplinary Design Optimization |
Subjects: | |
Online Access: | https://www.ijsmdo.org/articles/smdo/full_html/2021/01/smdo210083/smdo210083.html |
Similar Items
-
A Survey of the Nurse Rostering Solution Methodologies: The State-of-the-Art and Emerging Trends
by: Chong Man Ngoo, et al.
Published: (2022-01-01) -
A tabu search approach with embedded nurse preferences for solving nurse rostering problem
by: Ramli Razamin, et al.
Published: (2020-01-01) -
Ant Colony Optimization Algorithm for Maintenance, Repair and Overhaul Scheduling Optimization in the Context of Industrie 4.0
by: Le Vu Tran, et al.
Published: (2019-11-01) -
Nurse Rostering Problem Considering Drect andIndirect Costs: Deferential Evolution Algorithm
by: Mohammad Reza Hassani, et al.
Published: (2021-06-01) -
Artificial intelligence and end user tools to develop a nurse duty roster scheduling system
by: Franklin Leung, et al.
Published: (2022-07-01)