博碩士論文 91332027 詳細資訊


姓名 谷明地(Ming-Tih Ku)  查詢紙本館藏   畢業系所 土木工程學系
論文名稱 高速公路交控中心修護人員供給規劃之研究
檔案 [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 良好的修護計劃可幫助高速公路局交控中心有效率地完成修護工作,以確保安全及營運順暢。然而,以往對於修護人員的排班,大多以人工經驗進行,不僅費時且往往無法配合實際之修護需求,造成人力的浪費。有關問題的相關文獻相當罕見,目前雖有初步的相關研究,然其規劃方式未考量目前實務上常採用之策略,以致效果有限。另本研究針對修護人力供給之問題,利用數學規劃及電腦演算法技巧,配合可行的管理策略,構建合適之修護人力供給規劃模式及解法,有效率地規劃修護人員之排班。
本研究首先依國內高速公路局交控中心現行之修護人員排班方式建構一基本模式,而後考慮不同排班班次、修護人員數及工作時間長度等,發展不同策略模式。此等模式可定式為整數規劃問題,屬NP-hard 性質的問題。由於本研究所構建之模式能在合理的時間內得以求得最佳解,並搭配使用lingo套裝數學規劃軟體協助設計。最後,本研究以交控中心實際修護資料為例,進行實例測試與分析。
摘要(英) A good maintenance plan can help Taiwan Freeway Traffic Center to efficiently perform maintenance so as to ensure its safety and travel punctuality. However, in the past , maintenance scheduling tasks were mostly performed by staff based on experience, which is not only time-consuming but also ineffective in meeting the maintenance requirements,This result in waste of manpower. There was very little literature discussing such problems in the past. Although a preliminary research was carried on recently, and practical strategies were not considered, limiting its effect in practice.
In this research, mathematical programming techniques and computer algorithms were used, incorporating and developing suitable models and solution methods, in order to help Taiwan Freeway Traffic Center efficiently and effectively plan their maintenance schedules and manpower supplies.
First a basic model was developed to several strategic models . These models are formulated as mixed integer programs. Since their problems can be optimally solved in a reasonably short time, A solution algorithm was used to solve the problems. LINGO system was used to code all necessary programs and apply the mathematical programming solver, as well to develop the solution algorithm. Finally, to evaluate the models and solution algorithm, A case study using the real operating data from a major Taiwan Freeway Traffic Center was used.
關鍵字(中) ★ 修護計劃
★ 整數規劃問題
★ 維修排班
★ 人力供給
關鍵字(英) ★ integer programs
★ good maintenance plan
★ manpower supplies
★ maintenance scheduling
論文目次 中文摘要.....................................…………….............................. ......................Ⅰ
英文摘要.........................................……………........................................... .....Ⅱ
目錄......................................................…………….............................. .............Ⅳ
圖目錄.....................................................…………….................................. ......Ⅵ
表目錄.......................................................……………........................... ...........Ⅷ
第一章 緒論.......................……………........................................... . .….. 1
1.1 研究背景與動機.............................…….................................. ...1
1.2 研究目的與範圍.......................................................……. ..... 2
1.3 研究方法與流程.......………...........................….........................2
第二章 文獻回顧.........…...........................……………....................... .... 4
2.1 人員排班的類型...........................................................................4
2.2 人員排班問題的求解方法...........................................................6
2.2.1 組員排班問題的求解................................................................6
2.2.2 人員指派問題的求解..............................................................7
2.3 小結........................................................................ ..9
第三章 模式架構........................………...................................………….. 10
3.1 交控系統修護規劃架構.............................................................10
3.1.1 修護單位現況分析..................................................................11
3.1.2 修護需求計算..........................................................................12
3.2 問題定式...........................................................................14
3.2.1 模式假設...........................................................................14
3.2.2 數學定式..................................................................................15
3.3 模式定式................... ….............................................................16
3.3.1 不分機型值勤班次規劃數學定式..........................................16
3.3.2單一機型人力供給規劃數學定式..... .... …….....................18
3.4 小結...........................................................................19
第四章 實例測試................…...............…….............................................. 20
4.1 資料分析.........................................................................20
4.1.1系統機型資料..................…………........................................20
4.1.2 修護項目資料..........................................................................21
4.1.3 修護需求量資料......................................................................21
4.2 模式發展...........................................................................22
4.2.1 電腦演算環境..........................................................................22
4.2.2 模式輸入資料..........................................................................22
4.2.3 模式輸出資料..........................................................................23
4.3 模式測試及結果分析.....................................................................24
4.3.1 不分機型求解結果..................................................................24
4.3.2 第二階段求解結果..................................................................29
4.3.3敏感度分析...... ..................................…………………....34
4.4 小結...........................................................................49
第五章結論與建議......................................................... 50
5.1 結論...........................................................................50
5.2 建議...........................................................................52
5.3 貢獻...........................................................................52
參考文獻 1. 王勇華,「人員排班問題啟發式解法之應用」,交通大學土木工程研究所碩士論文,1993 。
2. 杜宇平,「空服員排班網路模式之研究」,中央大學土木工程研究所博士論文,2000 。
3. .李宇欣、楊承道,「雙勤務人員排班問題」,運輸計劃季刊,第28卷,第3 期,第409-420 頁,1999 。
4. .李治綱、陳朝輝、郭彥秀,「台鐵司機員排班與輪班問題之研究」,中華民國第五屆運輸網路研討會論文集,第177-187 頁,2000 。
5. .連志平,「警察人員排班問題之研究」,交通大學土木工程研究所碩士論文,1998 。
6. 翁偉棟,「空勤組員公平性排班模式之研究」,國立交通大學運輸工程與管理系碩士論文,1999年。
7. 陳玉菁,「航空公司修護人員供給規劃之研究」,國立中央大學土木研究所碩 士論文,2001年。
8. 楊光宗,「警察派出所人員排班問題之研究」,國立海洋大學航運管理學系碩士論文,2002年。
9. 蔡智豪,「醫院護理人員僱用及排班之整合研究」,輔仁大學管理學研究所碩士論文,2002年。
10. 盧宗成,「捷運司機員排班問題之研究 - 以台北捷運公司為例」,國立交通大學運輸工程與管理系碩士論文,2000年。
11. .陳春益、李宇欣與盧華安,「飛機調度與定期維修整合模式之研究」,運輸計劃季刊,第二十六卷,第一期,第69-94 頁,1997 。
12. .顏上堯、林錦翌,「空服員排班組合最佳化之研究」,中國土木水利工程學刊,第九卷,第二期,第303-314 頁,1997 。
13. .顏上堯、羅智騰,「因應預期性航具維修之系統性飛航排程」,中國土木水利工程學刊,第八卷,第三期,第447-456 頁,1996 。
14. .顏上堯、翁綵穗,「季節轉換間緩衝期飛航排程之研究」,運輸計劃季刊,2000 。(已接受)
15. 蘇昭銘、張靖,「捷運系統站務人員排班模式之研究」,中華民國運輸學會第十三屆論文研討會論文集,第613-622 頁,1998 。
16. Alfares, H. K., “An Efficient Two-Phase Algorithm For Cyclic Days-Off Scheduling,” Computers Operational Research, Vol. 25,No.11, pp.913-923, 1998.
17. Aykin, T., “A Comparative Evaluation of Modeling Approaches to the Labor Shift Scheduling Problem,” European Journal of Operational Research, Vol.25, pp.381-397, 2000.
18. Bartholdi, J. J., “A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering,” Operations Research, Vol.29,pp.501-510, 1981.
19. Beasley, J. E., and Cao, B., “A Tree Search Algorithm for the Crew Scheduling Problem,” European Journal of Operational Research, Vol.94, No. 3, pp.517-526, 1996.
20. Beaumont, N., “Scheduling Staff using Mixed Integer Programming,” European Journal of Operational Research, Vol. 98,pp.473-484, 1997.
21. Bechtold, S. E., Brusco, M. J., and Showalter, M. J., “A Comparative Evaluation of Labor Tour Scheduling Method,” Decision Sciences,Vol. 22, pp.683-699, 1991.
22. Brusco, M. J., “Solving Personnel Tour Scheduling Problems Using the Dual All-integer Cutting plane,” IIE Transaction, Vol. 30, pp.835-844, 1998.
23. Brusco, M. J., and Jacobs, L. W., “Elimination Redundant Columns in Continuous Tour Scheduling Problems,” European Journal of Operational Research, Vol. 111, pp. 518-525,1998.
24. Brusco, M. J., and Johns, T. R., “A Sequential Integer Programming Method for Discontinuous Labor Tour Scheduling,” European Journal of Operational Research, Vol. 95, pp.537-548, 1996.
25. Brusco, M. J., and Johns, T. R., “Improving the Dispersion of Surplus Labor in Personnel Scheduling Solutions,” Computers and Industrial Engineering, Vol. 28, No. 4, pp. 745-754, 1998.
26. Caprera, A., Fischetti, M., Toth, P., Vigo, D., and Guida, P. L., “Algorithms for Railway Crew Management,” Mathematical Programming, Vol. 79, pp.125-141, 1997.
27. Easton, F. F., and Rossin, D. F., “Equivalent Alternate Solutions for the Tour Scheduling Problem,” Decision Sciences, Vol. 22, pp.1985-1007, 1991.
28. Higgins, A., “Scheduling of Railway Track Maintenance Activities and Crews,” Journal of the Operational Research Society, Vol. 49, pp.1026-1033, 1998.
29. Hoong, C. L., “On the Complexity of Manpower Shift Scheduling,” Computers and Industrial Engineering, Vol. 23, No. 1, pp. 93-102, 1996.
30. Langerman, J. J., and Ehlers, E. M., “Agent – Based Airline Scheduling,” Computers and Industrial Engineering, Vol. 33, No.3-4, pp. 849-852, 1997.
31. Morris, J. G., and Showalter, M. J., “Simple Approaches to Shift, Days-Off and Tour Scheduling Problems,” Management Science, Vol. 29, No. 8, pp. 942-950, 1983.
32. Narasimhan, R., “An Algorithm for Single Shift Scheduling of Hierarchical Workface,” European Journal of Operational Research, Vol. 96, pp.113-121, 1996.
33. Lucic, P., and Teodorovic, D., “A Fuzzy Set Theory Approach to the Aircrew Rostering Problem,” Fuzzy Set and System, Vol.95, pp. 261-271, 1998.
34. Lucic, P., and Teodorovic, D., “Simulated Annealing for the MultiObjective Aircrew Rostering Problem,” Transportation Research A, Vol. 33, pp. 19-45, 1999.
35. Ryan, D. M., “The Solution of Massive Generalized Set Partitioning Problem in Aircrew Rostering,” Journal of the Operational Research Society. Vol. 43, pp. 459-467, 1992.
36. Yan, S., and Chang, J. C., “Airline Cockpit Crew Scheduling,”European Journal of Operational Research, 2000.(accepted)
37. Yan, S., Tang, T. T., and Tu, Y. P., “Optimal Construction of Airline Individual Crew Pairings,” Computers and Operations Research, 2000.(accepted)
指導教授 顏上堯(Shang-Yao Yan) 審核日期 2004-7-12

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡