Solving a Bi-objective Nurse Rerostering Problem by Using a Utopic Pareto Genet...

• Author(s): Pato, Margarida Vaz ; Moz, Margarida
• Date: 2006
• Persistent ID: http://hdl.handle.net/10400.5/1429
• Origin: Repositório da UTL
• Subject(s): nurse scheduling; rerostering; bi-objective heuristics; genetic algorithms
• Document Type: Other
• Language: English

Description

Nurse rerostering arises when at least one nurse announces that she will be unable to undertake the tasks previously assigned to her. The problem amounts to building a new roster that satisfies the hard constraints already met by the current one and, as much as possible, fulfils two groups of soft constraints which define the two objectives to be attained. A bi-objective genetic heuristic was designed on the basis of a population of individuals characterised by pairs of chromosomes, whose fitness complies with the Pareto ranking of the respective decoded solution. It includes an elitist policy, as well as a new utopic strategy, introduced for purposes of diversification. The computational experiments produced promising results for the practical application of this approach to real life instances arising from a public hospital in Lisbon.