Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic

Abstract 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.

[1]  Sanja Petrovic,et al.  An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling , 2004, Metaheuristics for Multiobjective Optimisation.

[2]  Marco Laumanns,et al.  A Tutorial on Evolutionary Multiobjective Optimization , 2004, Metaheuristics for Multiobjective Optimisation.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

[5]  Peter I. Cowling,et al.  A Memetic Approach to the Nurse Rostering Problem , 2001, Applied Intelligence.

[6]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[7]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[8]  Uwe Aickelin,et al.  An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..

[9]  Patrick Siarry,et al.  Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization , 2005, Comput. Oper. Res..

[10]  Margarida Vaz Pato,et al.  A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem , 2000, PATAT.

[11]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[12]  Margarida Moz,et al.  An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules , 2003, Ann. Oper. Res..

[13]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[14]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[15]  Margarida Moz,et al.  Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models , 2004, Ann. Oper. Res..

[16]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[17]  James M. Tien,et al.  On Manpower Scheduling Algorithms , 1982 .