Nurse Scheduling Problem Using Backtracking
Nurse Scheduling Problem (NSP) is well-known NP-hard problem which may require exhaustive search to obtain optimal solution. Several heuristic algorithms have been already applied to this highly difficult and complicated problem. In this work, we suggested traditional backtrack algorithm to solve nurse scheduling problem. We compared the results from backtrack algorithm and other heuristic algorithms including genetic algorithm and simulated annealing. The experimental results showed the backtracking algorithm generated an optimal solution with small sizes of schedules compared to traditional heuristic algorithms.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Affiliations: Department of Computer Engineering, Hallym University, Chuncheon, Gangwondo 24252, Republic of Korea
Publication date: April 1, 2017
More about this publication?
- ADVANCED SCIENCE LETTERS is an international peer-reviewed journal with a very wide-ranging coverage, consolidates research activities in all areas of (1) Physical Sciences, (2) Biological Sciences, (3) Mathematical Sciences, (4) Engineering, (5) Computer and Information Sciences, and (6) Geosciences to publish original short communications, full research papers and timely brief (mini) reviews with authors photo and biography encompassing the basic and applied research and current developments in educational aspects of these scientific areas.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites