Abstract
This paper describes a technique of penalty weight adjustment for the Cooperative Genetic Algorithm applied to the nurse scheduling problem. In this algorithm, coefficients and thresholds for each penalty function are automatically optimized. Therefore, this technique provides a parameter free algorithm of nurse scheduling. The nurse scheduling is very complex task, because many requirements must be considered. These requirements are implemented by a set of penalty function in this research. In real hospital, several changes of the schedule often happen. Such changes of the shift schedule yields various inconveniences, for example, imbalance of the number of the holidays and the number of the attendance. Such inconvenience causes the fall of the nursing level of the nurse organization. Reoptimization of the schedule including the changes is very hard task and requires very long computing time. We consider that this problem is caused by the solution space having many local minima. We propose a technique to adjust penalty weights and thresholds through the optimization to escape from the local minima.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, New York (1989)
Goto, T., Aze, H., Yamagishi, M., Hirota, M., Fujii, S.: Application of GA, Neural Network and AI to Planning Problems. NHK Technical report, No.144, pp. 78–85 (1993)
Berrada, I., Ferland, J.A., Michelon, P.: A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints. Socio-Econ. Plann. Sci. 30(3), 183–193 (1996)
Takaba, M., Maeda, H., Sakaba, N.: Development of a Nurse Scheduling System by a Genetic Algothm. In: Proc. of 18th JCMI (1998)
Ikegami, A.: Algorithms for Nurse Scheduling. In: Proc. of 11th Intelligent System Symposium, pp. 477–480 (2001)
Burke, E.K., Cowling, P.: A Memetic Approach to the Nurse Rostering Problem. Applied Intelligence 15, 199–214 (2001)
Burke, E.K., De Causmaecker, P., Petrovic, S., Berghe, G.V.: Fitness Evaluation for Nurse Scheduling Problems. In: Proc. of the 2001 Congress on Evolutionary Computation (2001)
Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., Tsuruoka, S.: Automatic Generation of Nurse Scheduling Table Using Genetic Algorithm. Trans. on IEE Japan 122-C(6), 1023–1032 (2002)
Inoue, T., Furuhashi, T., Maeda, H., Takabane, M.: A Study on Interactive Nurse Scheduling Support System Using Bacterial Evolutionary Algorithm Enegine. Trans. on IEE Japan 122-C(10), 1803–1811 (2002)
Itoga, T., Taniguchi, N., Hoshino, Y., Kamei, K.: An Improvement on Search Efficiency of Cooperative GA and Application on Nurse Scheduling Problem. In: Proc. of 12th Intelligent System Symposium, pp. 146–149 (2003)
Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse Rostering Problems - a bibliographic survey. Europiean Journal of Operational Research 151, 447–460 (2003)
Burke, E.K., De Causmaecker, P., Berghe, G.V., Lnadeghem, H.: The State of the Art of Nurse Rostering. Journal of Scheduling 7, 441–499 (2004)
Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An Annotated Bibliography of Personnel Scheduling and Rostering. Annals of Operations Research 127, 21–144 (2004)
Burke, E.K., De Causmaecker, P., Berge, G.V.: Novel Meta-Heuristic Approaches to Nurse Rostering Problems in Belgian Hospitals. In: Leung, J. (ed.) Handbook of Scheduling Algorithms, Models and Performance Analysis (2004)
Li, J., Aickelin, U.: The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 581–590. Springer, Heidelberg (2004)
Bard, J.F., Purnomo, H.W.: Preference Scheduling for Nurses using Column Generation. Europiean Journal of Operational Research 164, 510–534 (2005)
Özcan, E.: Memetic Algorithms for Nurse Rostering. In: Yolum, I., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 482–492. Springer, Heidelberg (2005)
Ohki, M., Morimoto, A., Miyake, K.: Nurse Scheduling by Using Cooperative GA with Efficient Mutation and Mountain-Climbing Operators. In: 3rd Int. IEEE Conference Intelligent Systems, pp. 164–169 (2006)
Burke, E.K., De Causmaecker, P., Petrovic, S., Berge, G.V.: Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling. Applied Artificial Intelligence 20(3) (2006)
Ohki, M., Uneme, S., Hayashi, S., Ohkita, M.: Effective Genetic Operators of Cooperative Genetic Algorithm for Nurse Scheduling. In: 4th Int. INSTICC Conference on Informatics in Control, Automation and Robotics, pp. 347–350 (2007)
Bard, J.F., Purnomo, H.W.: Cyclic Preference Scheduling of Nurses Using a Lagrangian-Based Heuristic. Journal of Scheduling 10, 5–23 (2007)
Uneme, S., Kawano, H., Ohki, M.: Nurse Scheduling by Cooperative GA with Variable Mutation Operator. In: Proc. of 10th ICEIS, INSTICC, pp. 249–252 (2008)
Ohki, M., Uneme, S., Kawano, H.: Effective Mutation Operator and Parallel Processing for Nurse Scheduling. Studies in Computational Intelligence 299, 229–242 (2010). doi:10.1007/978-3-642-13428-9_10
Ohki, M.: Effective Mutation Operator for Nurse Scheduling by Cooperative GA and Its Parallel Processing. In: Proc. of 19th Int. ACM Workshop on Parallel Architectures and Bioinspired Algorithms, pp. 1–8 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohki, M., Kishida, S. (2014). An Effective Nurse Scheduling by a Parameter Free Cooperative GA. In: Esparcia-Alcázar, A., Mora, A. (eds) Applications of Evolutionary Computation. EvoApplications 2014. Lecture Notes in Computer Science(), vol 8602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45523-4_77
Download citation
DOI: https://doi.org/10.1007/978-3-662-45523-4_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45522-7
Online ISBN: 978-3-662-45523-4
eBook Packages: Computer ScienceComputer Science (R0)