Comparison and hybridization of crossover operators for the nurse scheduling problem
Broos Maenhout () and
Mario Vanhoucke
Annals of Operations Research, 2008, vol. 159, issue 1, 333-353
Abstract:
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 subject to various hard constraints. In the literature, several genetic algorithms have been proposed 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. Copyright Springer Science+Business Media, LLC 2008
Keywords: Meta-heuristics; Hybridization; Nurse scheduling (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-007-0268-z (text/html)
Access to full text is restricted to subscribers.
Related works:
Working Paper: A Comparison and Hybridization of Crossover Operators for the Nurse Scheduling Problem (2006) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:159:y:2008:i:1:p:333-353:10.1007/s10479-007-0268-z
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-007-0268-z
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().