Abstract
It is laborious to determine nurse scheduling using human-involved manner in order to account for administrative operations, business benefits, and nurse requests. To solve this problem, a mathematical formulation is proposed where the hospital administrators can set multiple objectives and stipulate a set of scheduling constraints. We then present a multiobjective optimization method based on the cyber swarm algorithm (CSA) to solve the nurse scheduling problem. The proposed method incorporates salient features from particle swarm optimization, adaptive memory programming, and scatter search to create benefit from synergy. Two simulation problems are used to evaluate the performance of the proposed method. The experimental results manifest that the proposed method outperforms NSGA II and MOPSO in terms of convergence and diversity performance measures of the produced results.
This is a preview of subscription content, log in via an institution to check access.
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
Berrada, I., Ferland, J., Michelon, P.: A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Economic Planning Sciences 30, 183–193 (1996)
Azaiez, M.N., Al Sharif, S.S.: A 0-1 goal programming model for nurse scheduling. Computers & Operations Research 32, 491–507 (2005)
Burke, E.K., Li, J., Qu, R.: A Hybrid Model of Integer Programming and Variable Neighbourhood Search for Highy-Constrained Nurse Rostering Problems. European Journal of Operational Research 203, 484–493 (2010)
Burke, E.K., Li, J., Qu, R.: A Pareto-based search methodology for multi-objective nurse scheduling. Annals of Operations Research (2010)
Yin, P.Y., Glover, F., Laguna, M., Zhu, J.X.: Cyber swarm algorithms – improving particle swarm optimization using adaptive memory strategies. European Journal of Operational Research 201, 377–389 (2010)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. Technical Report 103, ETH, Switzerland (2001)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transaction on Evolutionary Computation 6, 42–50 (2002)
Coello Coello, A.C., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Trans. on Evolutionary Computation 8, 256–279 (2004)
Laguna, M., Marti, R.: Scatter Search: Methodology and Implementation in C. Kluwer Academic Publishers, London (2003)
Branke, J., Mostaghim, S.: About selecting the personal best in multi-objective particle swarm optimization. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 523–532. Springer, Heidelberg (2006)
Mostaghim, S., Teich, J.: Strategies for finding local guides in multi-objective particle swarm optimization (MOPSO). In: Proceedings of the IEEE Swarm Intelligence Symposium 2003 (SIS 2003), Indianapolis, Indiana, USA, pp. 26–33 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, PY., Chao, CC., Chiang, YT. (2011). Multiobjective Optimization for Nurse Scheduling. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds) Advances in Swarm Intelligence. ICSI 2011. Lecture Notes in Computer Science, vol 6729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21524-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-21524-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21523-0
Online ISBN: 978-3-642-21524-7
eBook Packages: Computer ScienceComputer Science (R0)