(3.227.208.0) 您好!臺灣時間:2021/04/20 14:39
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:洪翊豪
研究生(外文):Yi-Hao Hong
論文名稱:應用回溯法於護理人員換班程式設計
論文名稱(外文):Applying the Backtracking Method to the Nurse Shift Exchanging Program Design
指導教授:侯玉松侯玉松引用關係
指導教授(外文):Yu-Song Hou
學位類別:碩士
校院名稱:中華大學
系所名稱:生物資訊學系碩士班
學門:生命科學學門
學類:生物訊息學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:33
中文關鍵詞:換班回溯法圖形迴圈
外文關鍵詞:shiftbacktrackinggraphicsloop
相關次數:
  • 被引用被引用:3
  • 點閱點閱:167
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:27
  • 收藏至我的研究室書目清單書目收藏:0
在目前研究中,有許多人致力於排班的研究,想辦法排出最好的班表,卻沒注意到,其實一個再怎麼完美的班表,一定會有人會提出不同的看法,而產生抱怨,或是護士本身臨時有其他事情需要跟其他護士換班。因此設計一個可以幫護士快速搜尋可換班的方法為本研究目的。
目前來說還尚未看到有針對換班的研究發表,護士之間需要換班還是以人與人之間互相協調出來。所以本篇論文將想換班當天的班表資料轉換成圖形,再運用回溯法從圖形裡找出使用者所設定的人數內換班的所有迴圈,並過濾出可換班的方式。

In the current study, there are many people committed to researching ways to come up with the best roster when scheduling working hours. No one noticed that no matter how perfect a roster appeared, there would always be someone that had different opinions. It often results in complaints from those who have different point of views. Sometimes nurses would have something that comes up at the last minute so they would have to switch shifts with other nurses. Therefore, the purpose of this research is to come up with a program to help nurses quickly search out ways to switch shifts with other nurses.
Presently, there has yet been seen a published study concerning the changing of shifts. The changing of shifts between nurses still requires direct contact and co-ordination between people. So this paper is dedicated to finding out a way for those who want to change shifts on a certain date to pull up the schedules of those who have shifts on the same date and convert the information into graphics. The graphics then uses backtracking to find all the loops in the different shifts and filters out the shifts that can be changed.

第一章 簡介.....................................................................................................1
1-1護理人員換班問題概述..............................................................................1
1-2護理人員換班問題之目的與架構..............................................................4
第二章 文獻回顧……………………………………………………………..5
2-1基因演算法………………………………………………………………...5
2-2禁忌搜尋法………………………………………………………………...6
2-3變動鄰域搜尋法…………………………………………………………...7
2-4整數規劃法……………………….………………………………………..7
2-5爬山法………………………..………………………………………….....8
第三章 回溯法..................................................................................................10
3-1回溯法的原理. ……………………..……………………………………..10
3-2回溯法的應用..............................................................................................11
第四章 應用回溯法於護理人員換班程式設計..............................................16
4-1圖形演算法基本概念 ................................................................................16
4-2護理人員換班表之圖形轉換 ....................................................................19
4-3迴圈的意義 ................................................................................................22
4-4找尋換班的圖形中所有迴圈的方法 ........................................................23
第五章執行過程與結果 ..................................................................................24
5-1程式執行過程..............................................................................................25
5-2程式執行的結果..........................................................................................27
第六章結論........................................................................................................29
參考文獻 ..........................................................................................................30

[1] H. Miller, P. William and J. R. Gustave, “Nurse Scheduling Using Mathematical Programming,”Operations Research 24 (5) (1976) pp. 857-870.
[2] C. Valouxis and E. Housos, “Hybrid Optimization Techniques for The Workshift and Rest Assignment of Nursing Personnel”, Artificial Intelligence in Medicine, Vol. 20 (2000) pp. 155-175.
[3] U. Aickelin and K. Dowsland, “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem”, Journal of Scheduling 3 (3) (2000) pp. 139–153.
[4] 郭金青,《整數目標規劃應用於護士排班之個案研究》,國立中正大學企業管理研究所碩士論文,兩階段限制規劃模式求解護理人員輪值問題,民國85年。
[5] 郭娓吟,《整數目標規劃應用於護理人力-以中部某醫院附設護理之家為例》,中國醫藥學院醫務管理研究所碩士論文,民國91年。
[6] 劉光宗,《數位化護理人員排班系統之研究》,國立東華大學企業管理學系碩士論文,民國90年。
[7] B. Jaumard, F. Semet and Vovor, T., “A Generalized Linear Programming Model for Nurse Scheduling,” European Journal of Operational Research 107 (1998) pp. 1-18.

[8] H. E. Miller, P. William and J. R. Gustave, “Nurse Scheduling Using Mathematical Programming,”Operations Research 24 (5) (1976) pp. 857-870.
[9] H. Millar and M. Kiragu, “Cyclic and Non-Cyclic Scheduling of 12h Shift Nurses by Network Programming,” European Journal of Operational Research 104 (1998) pp. 582-592.
[10] E.K. Burke, P. De Causmaecker, S. Petrovic and G. Vanden Berghe, “Fitness Evaluation for Nurse Scheduling Problems, in: Proceedings of the Congress on Evolutionary Computation (CEC2001)”, IEEE Press, Seoul, Korea, 2001, pp. 1139–1146.
[11] E.K. Burke, P. De Causmaecker and G. Vanden Berghe, “Novel Meta-heuristic Approaches to Nurse Rostering Problems in Belgian Hospitals”, in: J. Leung (Ed.), Handbook of Scheduling: Algorithms, Models and Performance Analysis, CRC Press, (2004)pp. 44/1-44/18.
[12] E.K. Burke, P. De Causmaecker, S. Petrovic and G. Vanden Berghe, “Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling”, Applied Artificial Intelligence 20 (3) (2006) pp.743-766.
[13] U. Aickelin and K. Dowsland, “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem”, Journal of Scheduling 3 (3) (2000) pp. 139–153.
[14] E.K. Burke, P. De Causmaecker, S. Petrovic and G. Vanden Berghe, “Fitness evaluation for nurse scheduling problems”, in: Proceedings of the Congress on Evolutionary Computation (CEC2001), IEEE Press, Seoul, Korea, 2001, pp. 1139–1146.
[15] J.H. Holland, “Adaptation in natural and artificial systems”. Ann Arbor, MI: University of Michigan Press, (1975).
[16] F. Glover, “Tabu Search: A Tutorial”, Interfaces, Vol. 20 (1990) pp. 74-94.
[17] E.K. Burke, P. De Causmaecker and G. Vanden Berghe, “A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem”, in: B. McKay et al. (Eds.), Simulated Evolution and Learning, Selected Papers from the 2nd Asia-Pacific Conference on Simulated Evolution and Learning, SEAL 98, Springer Lecture Notes in Artificial Intelligence, vol. 1585, Springer (1999) pp. 187–194.
[18] E.K. Burke, P. Cowling, P. De Causmaecker and G. Vanden Berghe, “A Memetic Approach to the Nurse Rostering Problem”, Applied Intelligence 15 (3) (2001) pp. 199–214.
[19] U. Aickelin and J. Li, “The application of Bayesian optimization and classifier systems in nurse scheduling”, in: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII) Springer Lecture Notes in Computer Science 3242 Springer, Birmingham, UK (2004) pp. 581–590.
[20] K.A. Dowsland, “Nurse Scheduling with Tabu Search and Strategic Oscillation”, European Journal of Operational Research 106 (2) (1998) pp. 393–407.
[21] E. Horowitz, S. Sahni and S. Rajasekaran, “Computer Algorithms”, Computer Science Press Inc. (1998).
[22] E.K. Burke, P. De Causmaecker, S. Petrovic and G. Vanden Berghe, “Variable Neighborhood Search for Nurse Rostering Problems”, in: M.G.C. Resende, J.P. de Sousa (Eds.), Metaheuristics: Computer Decision-Making, Kluwer, 2004, pp. 153–172.
[23] P. Hansen and N. Mladenovic’, “An introduction to variable neighborhood search”, in: S. Voss et al. (Eds.), Meta-heuristics: Advances and trends in local searchs paradigms for optimization, Kluwer Academic Publishers (1999) pp. 433–458.
[24] E.K. Burke, T. Curtois, G. Post, R. Qu and B. Veltman, “A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem”, European Journal of Operational Research 188 (2008) pp. 330–341.
[25] N. Mladenovic’ and P. Hansen, “Variable neighborhood search", Computers and Operations Research 24 (11) (1997) pp. 1097–1100.
[26] 李俊德,《兩階段限制規劃模式求解護理人員輪值問題》,國立交通大學運輸科技與管理學系所碩士論文,民國96年。
[27] 韓復華、李俊德,〈兩階段限制規劃模式求解護理人員輪值問題〉,《管理與系統》,第14卷,第1期,民國96年。
[28] U. Aickelin and J. Li, “A Bayesian optimization algorithm for the nurse scheduling problem”, in: Proceedings of 2003 Congress on Evolutionary Computation (CEC2003), IEEE Press, Canberra, Australia (2003) pp. 2149–2156.
[29] J.F. Bard and H.W. Purnomo, “Preference scheduling for nurses using column generation”, European Journal of Operational Research 164 (2) (2005) pp. 510–534.
[30] F. Bellanti, G. Carello, F.D. Croce and R. Tadei, “A greedy based neighborhood search approach to a nurse rostering problem”, European Journal of Operational Research 153 (2004) pp. 28–40.
[31] B. Cheang, H. Li and A. Lim, “Nurse Rostering Problems – a Bibliographic Survey”, European Journal of Operational Research 151 (2003) pp. 447-460.
[32] C. Valouxis and E. Housos, “Hybrid Optimization Techniques for The Workshift and Rest Assignment of Nursing Personnel,” Artificial Intelligence in Medicine, Vol. 20 (2000) pp. 155-175.
[33] 林純玉,《護理人員排班程式設計與實作》,中華大學生物資訊學系碩士班碩士論文,民國98年。
[34] 黃翔瑞,《改良爬山演算法於護理排班程式設計》,中華大學生物資訊學系碩士論文,民國100年。

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔