應用禁忌演算法於護理人員排班程式設計

Applying Tabu Algorithm to the Nurse Rostering Program Design

張鈺生(Yu-Sheng Chang) ； 侯玉松(Yu-Sung Hou) ； 曾麗卿(Li-Ch'ing Tseng)

《Journal of Information Technology and Applications(資訊科技與應用期刊)》 6卷3期 (2012/09) Pp. 145-150

https://doi.org/10.6302/JITA.201209_6(3).0006

摘要

目前研究中，護理人員排班在目前仍是NP-hard問題，尚未有高效率和滿足限制的最佳解決方法，對於醫院中護理人員而言，一份高效能的班表會直接影響到護理服務的士氣與熱忱，是每位護理長需面對的課題。因此，如何設計一份遵守法規和滿足護理人員需求的班表為本研究目的。不同國籍的護理排班方式，無法直接導入國內醫護人員來使用，目前仍多以人工方式進行排班。依循前學者的研究，配合彰化基督教醫院取得的實際資料，利用爬山法產生的班表會受限於局部最佳解，無法取得全域的最佳解；因此運用禁忌演算法的有、無渴望條件改進，實測護理人員排班程式，找尋出排班的優良可行解。

關鍵字

護理人員排班 ； 禁忌演算法 ； 渴望條件

並列摘要

In the current study, the nurse rostering is still a NP-hard problem, has not been high-efficiency and the best solution to meet the limits for hospital nurses, a high-performance affect the nursing service morale and enthusiasm. Each charge nurses needs to face the issue. Therefore, research purposes that the design of how to produced a compliance and meet the needs of nursing rostering schedule.Way of care shifts of different nationalities, can not directly import domestic nurse to use. Rostering schedule is still mostly artificial way. Follow the before scholars with the ”Chunghua Christian Hospital” to obtain actual data. Applying of hill-climbing algorithm will be limited to local optimal solution table and unable to obtain the global optimal solution. Applying tabu algorithm have aspiration criteria or not have, that to the actual testing nurse rostering program are find of the scheduling of good feasible solution.

並列關鍵字

nurse rostering ； tabu Search ； aspiration criteria