A Comparison and Hybridization of Crossover Operators for the Nurse Scheduling Problem
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Ghent University, Faculty of Economics and Business Administration in its series Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium with number 06/366.
Length: 20 pages
Date of creation: Jan 2006
Date of revision:
meta-heuristics; hybridization; nurse scheduling;
This paper has been announced in the following NEP Reports:
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.:
- 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.
- 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.
- 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.
- 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.
- Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
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.