A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
An Integer Programming based Ant Colony Optimisation Method for Nurse Rostering
2017
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems
Nurse rostering problems are typically too large and hard to be solved exactly. In order to achieve quality solutions to these difficult problems, meta-heuristics are often employed. One such meta-heuristic is Ant Colony Optimisation (ACO), inspired by the pheromone trails left by ants. ACO works by guiding a heuristic solution construction by using these pheromones to direct weighted random choices. When the problem to be solved is highly constrained, finding feasible solutions is difficult,
doi:10.15439/2017f237
dblp:conf/fedcsis/BuntonEK17
fatcat:ppmgrsrdv5ad5lqzopvxy72jyu