A Comparison and Hybridization of Crossover Operators for the Nurse Scheduling Problem
In this paper, we present a hybrid genetic algorithm for the well-known nurse scheduling problem (NSP). The NSP involves the construction of roster schedules for nursing staff in order to maximize the quality of the roster schedule and to minimize the violations of the minimal coverage requirements subject to various hard case-specific constraints. In literature, several genetic algorithms have been proposed in literature to solve the NSP under various assumptions. The contribution of this paper is twofold. First, we extensively compare the various crossover operators and test them on a standard dataset in a solitary approach. Second, we propose several options to hybridize the various crossover operators.
|Date of creation:||Jan 2006|
|Contact details of provider:|| Postal: Hoveniersberg 4, B-9000 Gent|
Phone: ++ 32 (0) 9 264 34 61
Fax: ++ 32 (0) 9 264 35 92
Web page: http://www.ugent.be/eb
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- M. Vanhoucke & B. Maenhout, 2005. "Characterisation and Generation of Nurse Scheduling Problem Instances," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/339, Ghent University, Faculty of Economics and Business Administration.
- B. Maenhout & M. Vanhoucke, 2005.
"New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm,"
Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium
05/341, Ghent University, Faculty of Economics and Business Administration.
- Maenhout, B. & Vanhoucke, M., 2006. "New computational results for the nurse scheduling problem: A scatter search algorithm," Vlerick Leuven Gent Management School Working Paper Series 2006-06, Vlerick Leuven Gent Management School.
- Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
- A.T. Ernst & H. Jiang & M. Krishnamoorthy & B. Owens & D. Sier, 2004. "An Annotated Bibliography of Personnel Scheduling and Rostering," Annals of Operations Research, Springer, vol. 127(1), pages 21-144, March.
- Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
- Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
- Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
- Gary M. Thompson, 1995. "Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem," Management Science, INFORMS, vol. 41(4), pages 595-607, April.
- B. Maenhout & M. Vanhoucke, 2005. "An Electromagnetic Meta-Heuristic for the Nurse Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/316, Ghent University, Faculty of Economics and Business Administration. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:06/366. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe)
If references are entirely missing, you can add them using this form.