Advertisement

Search Algorithms for Nurse Scheduling with Genetic Algorithms

  • Ahmad Jan
  • Masahito Yamamoto
  • Azuma Ohuchi
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 43)

Abstract

This paper investigates the use of a genetic algorithms (GA) approach to a multi-objective optimization problem, in particular the nurse scheduling problem (NSP). Because GAs are computationally intensive algorithms, there is a strong need to make it effective. We define effective as producing good results in a short time. Our efforts so far revealed that for solving of the NSPs using a GA approach, unwanted premature convergence occurs in the early stages of the search. This is due to the presence of strong constraints and limiting of the search to feasible regions only. Therefore, diversification of the solution space plays a very important role for exploration of the potentially unexplored regions of the solution space. A mutation operator, or some kind of niching method is supposed to overcome this problem. The authors’ task is to enhance optimization of the search performance of GA for NSPs. First a simplified and later a more useful version of the problem are examined. The existence of the global optimum for the simplified version of the problem is known. However, the existence of the global optimum for the later version of the problem is unknown. Therefore, for the later version of the problem the objective is to acquire solutions as close to the Pareto efficient front as possible. So far the best results have been acquired by applying a simple and cost effective block-wise mutation operator that we call an escape operator. Throughout computer simulations, the aforementioned difficulties are analyzed and the efficiency of the so called escape operator is confirmed.

Keywords

Nurse Scheduling Problem Genetic Algorithms Decision Making Pareto Ranking Scheme 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yamamura M., Yamagishi M., Ase H. Genetic algorithm, Sangyou Tosho, 1995; 3: 89–126.Google Scholar
  2. Jan A., Yamamoto M., Ohuchi A., Operations Research from Theory to Real Life. Proceedings of the 15 th National Conference for Operation Research Inc. ASOR Queensland Branch and ORSJ Hokkaido Chapter Joint Workshop 1999; 1: 615–628.Google Scholar
  3. Yamamoto M., Kawamura H., Ohuchi A. Collective Approach to Optimization Problems. Proceedings of ITC-CSCC ′98,1998; 1479–1482.Google Scholar
  4. Bradley D. and Martin J. Continuous Personnel Scheduling Algorithms: A Literature Review. Journal of the Society for Health Systems 1990; 2: 8–23.Google Scholar
  5. Coello C. Handling. Preferences in Evolutionary Multiobjective Optimization: A Survey. Congress on Evolutionary Computation 2000, IEEE Piscataway, La Jolla California, USA 2000; 1:30–37.Google Scholar
  6. Goldberg, D. Genetic Algorithm in Search, Optimization and Machine Learning. Addison- Wesley, Reading, MA 1989.Google Scholar
  7. Richard K. Belew and Michael D. Vose. Foundations of Genetic Algorithms. Morgan Kaufman Publishers Inc 1997.Google Scholar
  8. Tapan P. Bagchi. Multiobjective Scheduling by Genetic Algorithms. Kluwer Academic Publishers 1999.Google Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Ahmad Jan
    • 1
  • Masahito Yamamoto
    • 1
  • Azuma Ohuchi
    • 1
  1. 1.Laboratory of Harmonious Systems Engineering, Research Group of Complex Systems Engineering, Division of Systems and Information Engineering, Graduate School of EngineeringHokkaido UniversitySapporoJapan

Personalised recommendations