| Summary: | 碩士 === 國立屏東科技大學 === 資訊管理系 === 93 === Nursing expenditure occupies 30~40 percentage of overall expenditure in most hospitals business operation costs. So how to successfully manage human resource and efficiently achieve business operation is crucial topic in hospital management. Nurse Scheduling is the process of generating timetables which specify the duty shifts to nurses over given period of time. In the past, correlated researches regarding nurse scheduling were presented using integer programming model, cyclical scheduling and elicitation method and so on, for getting fittest solutions (timetables).
The Nurse Scheduling Problem (NSP) is a combinatorial optimization problem. It is the task of allocating nurse duty in three shift modes under constraints.
In this thesis, an intelligent and efficient ant-based searching algorithm is, although used the ant system cannot be demonstrated whether it is optimal solution or not, but it can produce many approximately fittest solutions in a short time. Consequently, they are more suitable for nurse scheduling problems.
According to the experiment results, it is observed that the ant system is very efficient for solving nurse scheduling problem.
Keywords: Nurse Scheduling Problem, Ant Algorithm, Genetic Algorithm.
|
|---|
