Abstract
This paper describes the first Artificial Bee Colony (ABC) Algorithm approach applied to nurse scheduling evaluated under different working environments. For this purpose, the model has been applied on a real hospital where data taken from different departments of the hospital were used and the schedules from the model were compared with the existing schedules. The results obtained indicated that the proposed model exhibits success in solving the nurse scheduling problems in hospitals.
Article PDF
Avoid common mistakes on your manuscript.
6. References
C. Valouxis and E. Housos, Hybrid optimization techniques for the workshift and rest assignment of nursing personnel, Artificial Intelligence in Medicine, 20 (2) (2000) 2000–155.
E. Burke, P. Cowling, P. D. Causmaecker and G. V. Berghe, A memetic approach to the nurse rostering problem, Applied Intelligence, 15 (3) (2001) 2001–199.
E.K. Burke, T. Curtois, G. Post, R. Qu and B. Veltman, A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem, European J. of Operational Research, 188 (2) (2008) 2008–330.
J. Li, E. K. Burke, T. Curtois, S. Petrovic and R. Qu, The falling tide algorithm: a new multi objective approach for complex workforce scheduling, Omega-Int. J. of Man. Science, 40 (3) (2012) 2012–283.
U. Aickelin and K. A. Dowsland, An indirect genetic algorithm for a nurse-scheduling problem, Computers and Operations Research, 31 (5) (2004) 2004–761.
F. Bellanti, G. Carello, F. Della Croce and R. Tadei, A greedy-based neighborhood search approach to a nurse rostering problem, European Journal of Operational Research, 153 (2004) 28–40.
E. K. Burke, P. Causmaecker, S. Petrovic and G. V. Berghe, Metaheuristics for handling time interval coverage constraints in nurse scheduling, Applied Artificial Intelligence, 20 (9) (2006) 2006–743.
W. J. Gutjahra and M. S. Raunerb, An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria, Computers and Operations Research, 34 (2007) 642–666.
G. Beddoe, S. Petrovic and J. Li, A hybrid metaheuristic case-based reasoning system for nurse rostering, Journal of Scheduling, 12 (2) (2009) 2009–99.
H. Çivril, Genetic Algorithms for Nurse Scheduling Problems, M.Sc. Thesis, (Süleyman Demirel University Graduate School of Applied and Natural Science, Isparta, Turkey, 2009). (Language: Turkish).
B. Bilgin, P. Causmaecker, B. Rossie and G. V. Berghe, Local search neighbourhoods for dealing with a novel nurse rostering model, Annals of Operations Research, 194 (1) (2012) 2012–33.
E. K. Burke, J. Li and R. Qu, A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems, European J. of Operational Research, 203 (2) (2010) 2010–484.
T. M. Dias, D. F. Ferber, C. C. Souza and A. V. Moura, Constructing nurse schedules at large hospitals, International Transactions in Operational Research, 10 (2003) 245–265.
M. V. Chiaramonte and L. M. Chiaramonte, An agentbased nurse rostering system under minimal staffing conditions, International Journal Production Economics, 114 (2) (2008) 2008–697.
B. Maenhout and M. Vanhoucke, An evolutionary approach for the nurse rerostering problem, Computers and Operations Research, 38 (10) (2011) 2011–1400.
M. Cheng, H. I. Ozaku, N. Kuwahara, K. Kogure and J. Ota, Simulated annealing algorithm for daily nursing care scheduling problem, Proc. 3rd Annual IEEE Conference on Automation Science and Engineering, (Scottsdale, AZ, USA, 2007), pp. 507–512.
D. Parr and J. M. Thompson, Solving the multi-objective nurse scheduling problem with a weighted cost function, Annals of Operations Research, 155 (1) (2007) 2007–279.
B. Maenhout and M. Vanhoucke, An electromagnetic meta-heuristic for the nurse scheduling problem, Journal of Heuristics, 13 (4) (2007) 2007–359.
P. Brucker, E. K. Burke, T. Curtois, R. Qu and G. V. Berghe, A shift sequence based approach for nurse scheduling and a new Benchmark dataset, Journal of Heuristics, 16 (4) (2010) 2010–559.
B. Maenhout and M. Vanhoucke, Comparison and hybridization of crossover operators for the nurse scheduling problem, Annals of Operations Research, 159 (1) (2008) 2008–333.
C. Tsai and S. H. A. Li, A two-stage modeling with genetic algorithms for the nurse scheduling problem, Expert Systems with Applications, 36 (2009) 9506–9512.
A. Oughalime, W. R. İsmail and L. C. Yeun, A tabu search approach to the nurse scheduling problem, International Symposium on Information Technology, 1 (2008) pp. 1–7.
B. Cheang, H. Li, A. Lim and B. Rodrigues, Nurse rostering problems-a bibliographic survey, European Journal of Operational Research, 151 (2003) 447–460,
P. Causmaecker and G. V. Berghe, A categorisation of nurse rostering problems, J. Sched, 14(1) (2010) 3 – 16.
A. Baykasoğlu, L. Özbakır and P. Tapkan, Swarm intelligence: focus on ant and particle swarm optimization, Edited by Felix T. S. Chan and Manoj Kumar Tiwari, I-Tech Education and Publishing, 1th edn. (Vienna, Austria, 2007), pp. 114–144.
T. D. Seeley, S. Camazine and J. Sneyd, Collective decision-making in honey bees: how colonies choose among nectar sources, Behav Ecol Sociobiol, 28 (1991) 277–290.
K. Buyukozkan, A Bee Colony Algorithm For Nurse Scheduling Problem And An Application In A Health Service System, M.Sc. Thesis, (Selçuk University, Institute of Natural Sciences, Konya, Turkey, 2012). (Language: Turkish).
S. Nakrani and C. Tovey, On honey bees and dynamic server allocation in internet hosting centers, International Society for Adaptive Behavior, 12(3–4) (2004) 223–240.
X. Yang, Engineering optimizations via nature-inspired virtual bee algorithms, IWINAC, (Berlin Heidelberg, 2005), pp. 317–323.
S. Dehuri, S. Cho and A. K. Jagadev, A multi-agent approach for multiple campaigns assignment problem, International Conference on Information Technology, (2008) pp. 24–29.
P. Tapkan, L. Özbakır and A. Baykasoğlu, Bees algorithm and generalized assignment problem: comparison of different neighborhood structures, J. Industrial Engineering, 21(2) (2008) 2–13. (in Turkish).
C. Lara, J. J. Flores and F. Calderon, Solving a school timetabling problem using a bee algorithm, MICAI, (Berlin Heidelberg, 2008), pp. 664–674.
T. Davidovic, M. Selmic and D. Teodorovic, Scheduling independent tasks: bee colony optimization approach, 17th Mediterranean Conference on Control & Automation, (Makedonia Palace, Thessaloniki, Greece, 2009), pp. 1020–1025.
L. Özbakir, A. Baykasoğlu and P. Tapkan, Bees algorithm for generalized assignment problem, Applied Mathematics and Computation, 215(11) (2010) 3782 – 3795.
M. H. Kashani, M. Jamei, M. Akbari and R. M. Tayebi, Utilizing bee colony to solve task scheduling problem in distributed systems, Third International Conference on Computational Intelligence, Communication Systems and Network, (2011) pp. 298–303.
A. Kaur and S. Goyal, A Survey on the applications of bee colony optimization techniques, Int. J. Computer Science Eng., 3(8) (2011) 3037.
D. Teodorovic, T. Davidovic and M. Selmic, Bee colony optimization: the applications survey, Transactions on Computational Logic, (2011) 1–20.
B. Suri and Snehlata, Review of artificial bee colony algorithm to software testing, IJRRCS, 2 (3) (2011) 2011–706.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Buyukozkan, K., Sarucan, A. Applicability of artificial bee colony algorithm for nurse scheduling problems. Int J Comput Intell Syst 7 (Suppl 1), 121–136 (2014). https://doi.org/10.1080/18756891.2014.853957
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1080/18756891.2014.853957