臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：混合限制規劃法及數學規劃法求解大眾捷運系統司機員排班與輪值問題
作者：李俊德
作者(外文)：Li, Chun-Te
校院名稱：國立交通大學
系所名稱：運輸與物流管理學系
指導教授：韓復華
學位類別：博士
出版日期：2016
主題關鍵詞：司機員排班問題；司機員輪值問題；大眾捷運系統；限制規劃法；數學規劃法；非週期性輪值；Driver Scheduling Problem；Driver Rostering Problem；Mass Rapid Transit；Constraint Programming；Mathematical Programming；Acyclic Roster
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:0
司機員排班與輪值問題為大眾捷運系統營運時所面臨的重要議題之一。前者主要為求解涵蓋每日所有列車任務的最小勤務成本組合；後者則為制定司機員輪值表，確保輪值期內每日所有勤務均有司機員值勤。排班及輪值結果除直接影響人事成本外，規劃的勤務及輪值表內容亦將決定是否有給與司機員足夠的休息時間，避免疲勞駕駛而影響營運安全及顧客對企業之滿意度。
於實務上，捷運司機員排班與輪值除需滿足法規與公司規定外，另亦需儘量滿足司機員期望。在考量複雜的硬、軟限制下，即難以單純運用最佳化方法來求解，故本研究即提出運用限制規劃法與數學規劃法來建構相關模式。於司機員排班問題上，本研究先建構勤務產生限制規劃模式，產生滿足所有排班硬限制之可行勤務，並利用集合涵蓋模式求解最小勤務成本組合。此外，並依據可行勤務規模運用不同求解程序來求解最佳解。輪值問題則利用兩階段程序求解無固定班別的非週期性司機員輪值表。首先於第一階段利用目標規劃排休模式求解具休假公平之排休表。第二階段則運用勤務指派限制規劃模式，以第一階段結果為基礎，將每日勤務指派給需工作的司機員，並同時考量早班勤務、極早班勤務與長短班勤務公平分配軟限制。
本研究依據高雄捷運前鎮車班的實際資料與相關排班及輪值規定，求解3種車班表的最佳勤務組合與司機員月輪值表。於排班結果上，本研究除平日班表可節省2個勤務外，3種班表的勤務均較手排結果可較集中於8小時班並使用較少的加班勤務。此外，依據本研究勤務結果，輪值表可節省2位司機員即可涵蓋每日所有任務。於輪值表的休假公平性上，相較於手排輪值表，本研究可同時滿足司機員總休假數及總例假休假數公平性。而在早班、極早班與長短班勤務公平性上，亦可藉由限制規劃法的搜尋策略與範圍限制式來達到均勻分配的結果。運用本研究提出之有效率且具彈性的排班與輪值模式，規劃人員可快速地測試多種不同方案，尋找最合適的勤務與輪值表結果做為決策依據。
The article addresses driver scheduling and rostering problems for mass rapid transit (MRT) systems. The driver scheduling problem is to find a minimum cost of duties to cover all tasks for each timetable, and the driver rostering problem is to generate a roster to ensure each duty in a rostering horizon can be assigned to a driver. These problems are very important for MRT systems because of the results will affect labor costs and operational safety such as driver fatigue.
In real-world operations, the driver scheduling and rostering problems have to satisfy complex hard and soft rules. Such rules are complicated and difficult to follow through optimization methods alone. In this article, we propose a hybrid approach with constraint programming (CP) and mathematical programming (MP) models to solve these problems. The approach of the driver scheduling problem involves a CP model for duty generation, a set covering problem (SCP) model for duty optimization, and alternative ways to identify the final solution in different situation. For driver rostering problem, a two-phase heuristic approach is proposed to generate an acyclic roster. The first phase uses a goal programming (GP) model to solve the off-day scheduling. And the second phase applies a CP model to assign duties to drivers.
We applied our models to solve a case problem for the KRTC. Case application results using real-work data showed that our scheduling approach is capable of reducing the number of duties from 29 to 27 for the weekday timetable, and duties for each timetable can be more centralized in 8 hour shifts and less overtime shifts. According to the duties, we can save two drivers and our rostering approach can generate more equitable rosters such as the number of weekend-off, very early shifts etc. Given the efficient and flexible models, the manager can test different situations quickly to find more suitable duties and a roster.
[1] AhmdBeygi, S., Cohn, A., and Weir, M., “An Integer Programming Approach to Generating Airline Crew Pairings,” Comupters & Operations Research, Vol. 36, No. 4, pp. 1284-1298, 2009.
[2] Apt, K. R., Principles of Constraint Programming, Cambridge: Cambridge University Press, 2003.
[3] Arabeyre, J., Fearnley, F., Steiger, F., and Teather, W., “The Airline Crew Scheduling Problem: A Survey,” Transportation Science, Vol. 3, No. 2, pp. 140-163, 1969.
[4] Aydemir-Karadag, A., Dengiz, B., and Bolat, A., “Crew Pairing Optimization Based on Hybrid Approaches,” Comupters & Operations Research, Vol. 65, No. 1, pp. 87-96, 2013
[5] Azadeh, A., Farahani, M. H., Eivazy, H., Nazari-Shirkouhi, S., and Asadipour, G., “A Hybrid Meta-heuristic Algorithm for Optimization of Crew Scheduling,” Applied Soft Computing, Vol. 13, No. 1, pp. 158-164, 2013
[6] Baeklund, J, “Nurse Rostering at a Danish Ward,” Annals of Operations Research, Vol. 222, No. 1, pp. 107-123, 2014.
[7] Bennett, B. T., and Potts, R. B., “Rotating Roster for a Transit System,” Transportation Science, Vol. 2, No. 1, pp. 14-34, 1968.
[8] Bianco, L., Bielli, M., Mingozzi, A., Ricciardelli, S., and Spadoni, M., “A Heuristic-procedure for the Crew Rostering Problem,” European Journal of Operational Research, Vol. 58, No. 2, pp. 272-283, 1992.
[9] Blum, C., and Roli, A., “Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison,” ACM Computing Surveys, Vol. 35, No. 3, pp. 268-308, 2003.
[10] Boschetti M. A., Mingozzi A., and Ricciardelli S., “An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem,” Annals of Operations Research, Vol. 127, No. 1, pp. 177-201, 2004.
[11] Brailsford, S. C., Potts, C. N., and Smith, B. M., “Constraint Satisfaction Problem: Algorithms and Applications,” European Journal of Operational Research, Vol. 119, No. 3, pp. 557-581, 1999.
[12] Caprara, A., Fischetti, M., Toth, P., Vigo, D., and Guida, P. L., Algorithms for railway crew management,” Mathematical Programming, Vol. 79, No. 1–3, pp. 125–141, 1997.
[13] Caprara, A., Toth, P., Vigo, D., and Fischetti, M., “Modeling and Solving the Crew Rostering Problem,” Operations Research, Vol. 46, No. 6, pp. 820-830, 1998.
[14] Caprara, A., Focacci, F., Lamma, E., Mello, P., Milano, M., Toth, P., and Vigo, D., “Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem,” Software, Practice & Experience, Vol. 28, No. 1, pp. 49-76, 1998.
[15] Carraresi, P., and Gallo, G., “A Multi-level Bottleneck Assignment Approach to the Bus Drivers Rostering Problem,” European Journal of Operational Research, Vol. 16, No. 2, pp. 163-173, 1984.
[16] Cavique, L., Rego, C., and Themido, I., “Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem,” Journal of the Operational Research Society, Vol. 50, No. 6, pp. 608-616, 1999.
[17] Ceder, A., “Urban Transit Scheduling: Framework, Review and Examples,” Journal of Urban Planning and Development, Vol. 128, No. 4, pp. 225-244, 2002.
[18] Chang, S. C., “A New Aircrew-scheduling Model for Short-haul Routes,” Journal of Air Transport Management, Vol. 8, No. 4, pp. 249-260, 2002.
[19] Chen, C. H., Liu, T. K., and Chou, J. H., “Integrated Short-haul Airline Crew Scheduling Using Multiobjective Optimization Genetic Algorithms,” IEEE Transactions on Systems Man Cybernetics-System, Vol. 43, No. 5, pp. 1077-1090, 2013.
[20] Chen, M., and Niu, H., “A Model for Bus Crew Scheduling Problem with Multiple Duty Types,” Discrete Dynamics in Nature and Society, Vol. 2012, pp. 1-11, 2012.
[21] Chew, K. L., Pang, J., Liu, Q., Ou, J., and Teo, C. P., “An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT,” Annals of Operations Research, Vol. 108, No. 1, pp. 111-122, 2001.
[22] Chow, K. P., and Hui, C. K., “Knowledge-based System for Rostering,” Expert Systems with Applications. Vol. 6, No. 3, pp. 361-375, 1993.
[23] Chu, P. C., and Beasley, J. E., “Constraint Handling in Genetic Algorithms: The Set Partitioning Problem,” Journal of Heuristics, Vol. 4, No. 4, pp. 323-357, 1998.
[24] Chu, S. C. K., and Chan, E. C. H., “Crew Scheduling of Light Rail Transit in Hong Kong: From Modeling to Implementation,” Computers and Operations Research, Vol. 25, No. 11, pp. 887-894, 1998.
[25] Crainic, T. G., and Rousseau, J. M., “The Column Generation Principle and The Airline Crew Scheduling Problem,” INFOR, Vol. 25, No. 2, pp. 136-151, 1987.
[26] Dantzig, G. B., and Wolfe, P., “Decomposition Principle for Linear Programs,” Operations Research, Vol. 8, No. 1, pp. 101-111, 1960.
[27] Dawid, H., Konig, J., and Stauss, C., “An Enhanced Rostering Model for Airline Crews,” Computers & Operations Research, Vol. 28, No. 7, pp. 671-688, 2001.
[28] Day, P. R., and Ryan, D. M., “Flight Attendant Rostering for Short-haul Airline Operaions,” Operations Research, Vol. 45, No. 5, pp. 649-661, 1997.
[29] Desaulniers, G., “Managing Large Fixed Costs in Vehicle Routing and Crew Scheduling Problems Solved by Column Generation,” Computers & Operations Research, Vol. 34, No. 4, pp. 1221-1239, 2007.
[30] Deng, G. F., and Lin, W. T., “Ant Colony Optimization-based Algorithm for Airline Crew Scheduling Problem,” Expert Systems with Application, Vol. 38, No. 5, pp. 5787-5793, 2011.
[31] de Silva A., “Combining Constraint Programming and Linear Programming on an Example of Bus Driver Scheduling,” Annals of Operations Research, Vol. 108, No. 1, pp. 277-291, 2001.
[32] Desrochers, M., and Soumis, F., “A Column Generation Approach to The Urban Transit Crew Scheduling Problem,” Transportation Science, Vol. 23, No. 1, pp. 1-13, 1989.
[33] Dias, T. G., de Sousa, J. P., and Cunha, J. F., “Genetic Algorithms for The Bus Driver Scheduling Problem: A Case Study,” Journal of the Operational Research Society, Vol. 53, No. 3, pp. 324-335, 2002.
[34] Dowling, D., Krishnamoorthy, M., Mackenzie, H., and Sier, D., “Staff Rostering at a Large International Airport,” Annals of Operations Research, Vol. 72, No. 0, pp. 125-147, 1997.
[35] Elhallaoui, I., Desaulniers, G., Metrane, A., and Soumis, F., “Bi-dynamic Constraint Aggregation and Subproblem Reduction,” Computers & Operations Research, Vol. 35, No. 5, pp. 1713-1724, 2008.
[36] Elizondo, R., Parada, V., Pardenas L., and Artigues, C., “An Evolutionary and Constructive Approach to a Crew Scheduling Problem in Underground Passenger Transport,” Journal of Heuristics, Vol. 16, No. 4, pp. 575-591, 2010.
[37] Emden-Weinert, T., and Proksch, M., “Best Practice Simulated Annealing for the Airline Crew Scheduling Problem,” Journal of Heuristics, Vol. 5, No. 4, pp. 419-436, 1999.
[38] Ernst, A. T., Jiang, H., Krishnamoorthy, M., Nott, H., and Sier, D., “An Integrated Optimization Model for Train Crew Management,” Annals of Operations Research, Vol. 108, No. 1-4, pp. 211-224, 2001.
[39] Ernst, A. T., Jiang, H., Krishnamoorthy, M., and Sier, D., “Staff Scheduling and Rostering: A Review of Applications, Methods and Models,” European Journal of Operational Research, Vol. 153, No. 1, pp. 3-27, 2004.
[40] Fahle T., Junker U., Karisch S., Kohl N., Sellmann M., and Vaaben B., “Constraint Programming Based Column Generation for Crew Assignment,” Journal of Heuristics, Vol. 8, No. 1, pp. 59-81, 2002.
[41] Freling, R., Wagelmans, A. P. M., and Paixao, J. M. P., “An Overview of Models and Techniques for Integrating Vehicle and Crew Scheduling,” Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, Vol. 471, pp. 441-460, 1999.
[42] Freling, R., Lentink, R. M., and Wagelmans, A. P. M., “A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-price Algorithm,” Annals of Operations Research, Vol. 127, No. 1-4, pp. 203-222, 2004.
[43] Gamache, M., Soumis, F., Marquis, G. and Desrosiers, J., “A Column Generation Approach for Large-scale Aircrew Rostering Problems,” Operations Research, Vol. 47, No. 2, 247-263, 1999.
[44] Gander, P., “Fatigue Management in Air Traffic Control: the New Zealand Approach,” Transportation Research Part F: Traffic Psychology and Behaviour, Vol. 4, No. 1, 49-62, 2001.
[45] Gopalakrishnan, B. and Johnson, E. L. “Airline Crew Scheduling: State-of-the-art,” Annals of Operations Research, Vol. 140, No. 1, pp. 305-337, 2005.
[46] Goumopoulos, C., and Housos, E. “Efficient Trip Generation with a Rule Modeling System for Crew Scheduling Problems,” Journal of Systems and Software, Vol. 69, No. 1-2, pp. 43-56, 2004.
[47] Haase K., Desaulniers G., and Desrosiers J., Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems,” Transportation Science, Vol. 35, No. 3, pp. 286-303, 2001.
[48] Hamdy A. T. Operation Research: An Introduction, 7th ed., New Jersey: Pearson Education, Inc., pp. 347-360, 2003.
[49] Han, A. F., and Li, E. C. “A Constraint Programming-based Approach to the Crew Scheduling Problem of the Taipei Mass Rapid Transit System,” Annals of Operations Research, Vol. 223, No. 1, pp. 173-193, 2014.
[50] Hanafi, R., and Kozan, E., “A Hybrid Constructive Heuristic and Simulated Annealing for Railway Crew Scheduling,” Computers & Industrial Engineering, Vol. 70, pp. 11-19, 2014.
[51] Hao, G., Lai, K. K., and Tan, M., “A Neural Network Application in Personnel Scheduling,” Annals of Operations Research, Vol. 128, No. 1-4, pp. 65-90, 2004.
[52] He, F., and Qu, R., “A Constraint Programming Based Column Generation Approach to Nurse Rostering Problems,” Computers & Operations Research, Vol. 39, No. 12, pp. 3331-3343, 2012.
[53] Hollis, B. L., Forbes, M. A., and Douglas, B. E., “Vehicle Routing and Crew Scheduling for Metropolitan Mail Distribution at Australia Post,” European Journal of Operational Research, Vol. 173, No. 1, pp 133-150, 2006
[54] Huisman, D., “A Column Generation Approach for the Rail Crew Re-scheduling Problem,” European Journal of Operational Research, Vol. 180, No. 1, pp. 163-173, 2007.
[55] Huisman D., Freling R., and Wagelmans A. P. M., “Multiple-depot integrated vehicle and crew scheduling,” Transportation Science, Vol. 39, No. 4, pp. 491-502, 2005.
[56] Jeng, C. R., Liu, T. K., and Chang, Y. H., “Short-haul Airline Crew Rostering by Using Inequality-based Multiobjective Genetic Algorithm,” Transportation Research Record, Vol. 2052, pp. 37-45, 2008.
[57] Jutte, S., Albers, M., Thonemann, U. W., and Haase, K., “Optimizing Railway Crew Scheduling at DB Schenker,” Interfaces, Vol. 41, No. 2, pp. 109-122, 2011.
[58] Jutte, S., and Thonemann, U. W., “Divide-and-price: A Decomposition Algorithm for Solving Large Railway Crew Scheduling Problems,” European Journal of Operational Research, Vol. 219, No. 2, pp. 214-223, 2012.
[59] Kohl, N., and Karisch, S. E., “Airline Crew Rostering: Problem Types, Modeling, and Optimization,” Annals of Operations Research, Vol. 127, No. 1-4, pp. 223-257, 2004.
[60] Lagerholm, M., Peterson, C., and Soderberg, B., “Airline Crew Scheduling Using Potts Mean Field Techniques,” European Journal of Operational Research, Vol. 120, No. 1, pp. 81-96, 2000.
[61] Lavoie, S., Minoux, M., and Odier, E., “A New Approach for Crew Pairing Problems by Column Generation with An Application to Air Transportation,” European Journal of Operational Research, Vol. 35, No. 1, pp. 45-58, 1998.
[62] Levine, D., “Application of a Hybrid Genetic Algorithm to Arline Crew Scheduling,” Computers & Operations Research, Vol. 23, No. 6, pp. 547-558, 1996.
[63] Lezaun, M., Perez, G., and de la Maza, E., “Rostering in a Rail Passenger Carrier,” Journal of Scheduling, Vol. 10, No. 4-5, pp. 245-254, 2007.
[64] Liu, M., Haghani, A., and Tooaie, S., “Genetic Algorithm-Based Column Generation Approach to Passenger Rail Crew Scheduling,” Transportation Research Record, Vol. 2159, pp. 36-43, 2010.
[65] Lourenco, H. R., Paixao, J. P., and Portugal, R., “Multiobjective Metaheuristics for the Bus-driver Scheduling Problem,” Transportation Science, Vol. 35, No. 3, pp. 331-343, 2001.
[66] Lucic, P., and Teodorovic, D., “Simulated Annealing for the Multi-objective Aircrew Rostering Problem,” Transportation Research Part A: Policy and Practice, Vol. 33, No. 1, pp. 19-45, 1999.
[67] Lucic, P., and Teodorovic, D., “Metaheuristics Approach to the Aircrew Rostering Problem,” Annals of Operations Research, Vol. 155, No. 1, pp. 311-338, 2007.
[68] Lusby, R., Dohn, A., Range, T. M., and Larsen, J., “A Column Generation-based Heuristic for Rostering with Work Patterns,” Journal of the Operational Research Society, Vol. 63, No. 2, pp. 261-277, 2012.
[69] Lustig, I. J., and Puget, J. F., “Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming,” Interfaces, Vol. 31, No. 6, pp. 29-53, 2001.
[70] Maenhout, B., and Vanhoucke, M., “A Hybrid Scatter Search Heuristic for Personalized Crew Rostering in the Airline Industry,” European Journal of Operational Research, Vol. 206, No. 1, pp. 155-167, 2010.
[71] Makri, A., and Klabjan, D., “A New Pricing Scheme for Airline Crew Scheduling,” Informs Journal on Computing, Vol. 16, No. 1, pp. 56-67, 2004.
[72] Mason, A. J., Ryan, D. M., and Panton, D, M., “Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling,” Operations Research, Vol. 46, No. 2, pp. 161-175, 1998.
[73] Medard, C. P., and Sawhney, N., “Airline Crew Scheduling from Planning to Operations,” European Journal of Operational Research, Vol. 183, No. 3, pp. 1013-1027, 2007.
[74] Mesquita, M., Moz, M., Paias, A., Paixao, J., Pato, M., and Respicio, A., “A New Model for the Integrated Vehicle-crew-rostering Problem a Computational Study on Rosters,” Journal of Scheduling, Vol. 14, No. 4, pp. 319-334, 2011.
[75] Mesquita, M., Moz, M., Paias, A., and Pato, M., “A Decomposition Approach for the Integrated Vehicle-crew-rostering Problem with Days-off Pattern,” European Journal of Operational Research, Vol. 229, No. 2, pp. 318-331, 2013.
[76] Mesquita M., and Paias A., “Set Partitioning/covering-based Approaches for the Integrated Vehicle and Crew Scheduling Problem,” Computers & Operations Research, Vol. 35, No. 5, pp. 1562-1575, 2008.
[77] Monfroglio, A., “Hybrid Genetic Algorithms for a Rostering Problem,” Software, Practice & Experience, Vol. 26, No. 7, pp. 851-862, 1996.
[78] Nicoletti, B., “Automatic Crew Rostering,” Transportation Science, Vol. 9, No. 1, pp. 33-42, 1975.
[79] Park, T., and Ryu, K. R., “Crew Pairing Optimization by a Genetic Algorithm with Unexpressed Genes,” Journal of Intelligent Manufacturing, Vol. 17, No. 4, pp. 375-383, 2006.
[80] Potthoff, D., Huisman, D., and Desaulniers, G., “Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling,” Transportation Science, Vol. 44, No. 3, pp. 493-505, 2010.
[81] Respicio, A., Moz, M., and Pato, M. V., “Enhanced Genetic Algorithms for a Bi-objective Bus Driver Rostering Problem: A Computational Study,” International Transactions in Operational Research, Vol. 20, No. 4, pp. 443-470, 2013.
[82] Rezanov, N. J., and Ryan, D. M., “The Train Driver Recovery Problem – A Set Partitioning Based Model and Solution Method,” Computers & Operations Research, Vol. 37, No. 5, pp. 845-856, 2010.
[83] Rousseau, L., M., Gendreau, M., and Pesant, G., “A General Approach to the Physician Rostering Problems,” Annals of Operations Research, Vol. 115, No. 1-4, pp. 193-205, 2002.
[84] Russell, S., and Norvig, P., Artificial Intelligence: A Modern Approach, 2nd ed., New Jersey: Pearson Education, Inc., 2003.
[85] Sellmann, M., Zervoudakis, K., Stamatopoulos, P., and Fahle, T., “Crew Assignment Via Constraint Proramming: Integrating Column Generation and Heuristic Tree Search,” Annals of Operations Research, Vol. 115, No. 1-4, pp. 207-225, 2002.
[86] Shen, Y. D., Peng, K. K., Chen, K., and Li, J. P., “Evolutionary Crew Scheduling with Adaptive Chromosomes,” Transportation Research Part B: Methodological, Vol. 56, pp. 174-185, 2013.
[87] Sodhi, M. S, and Norris, S., “A Flexible, Fast, and Otimal Modeling Approach Applied to Crew Rostering at London Underground,” Annals of Operations Research, Vol. 127, No. 1-4, pp. 259-281, 2004.
[88] Soto, R., Crawford, B., Monfroy, E., Palma, W., and Paredes, F., “Nurse and Paramedic Rostering with Constraint Programming: A Case Study,” Romanian Journal of Information Science and Technology, Vol. 16, No. 1, pp. 52-64, 2013.
[89] Souai, N., and Teghem, J., “Genetic Algorithm Based Approach for the Integrated Airline Crew-pairing and Rostering Problem,” European Journal of Operational Research, Vol. 199, No. 3, pp. 674-683, 2009.
[90] Steinzen, I., Gintner, V., Suhl, L., and Kliewer, N., “A Time-space Network Approach for the Integrated Vehicle- and Crew-scheduling Problem with Multiple Depots,” Transportation Science, Vol. 44, No. 3, pp. 367-382, 2010.
[91] Stojkovic, M., and Soumis, F., “An Optimization Model for the Simultaneous operational Flight and Pilot Scheduling Problem,” Management Science, Vol. 47, No. 9, pp. 1290-1305, 2001.
[92] Toth, A., and Kresz, M., “An Efficient Solution Approach for Real-world Driver Scheduling Problems in Urban Bus Transportation,” Central European Journal of Operations Research, Vol. 21, No. 1 Supplement, pp. 75-94, 2013.
[93] Valouxis, C., and Housos, E., “Combined Bus and Driver Scheduling,” Computers & Operations Research, Vol. 29, No. 3, pp. 243-259, 2002.
[94] Veelenturf, L. P., Potthoff, D., Huisman, D., and Kroon, L. G., “Railway Crew Rescheduling with Retiming,” Transportation Research Part C: Emerging Technologies, Vol. 20, No. 1, pp. 95-101, 2012.
[95] Ven den Bergh, J., Belien, J., De Bruecker, P., Demeulemeester, E., and De Boeck, L., “Personnel Scheduling: A Literature Review,” European Journal of Operational Research, Vol. 226, No. 3, pp. 367-385, 2013.
[96] Xie, L., Kliewer, N., and Suhl, L, “Integrated Diver Rostering Problem in Public Bus Transit,” Procedia – Social and Behavioral Sciences, Vol. 54, pp. 656-665, 2012.
[97] Yan, S. Y., and Chan, J. C., “Airline Cockpit Crew Scheduling,” European Journal of Operational Research, Vol. 136, No. 3, pp. 501-511, 2002.
[98] Yan, S., Tung, T.-T., and Tu, Y.-P., “Optimal construction of airline individual crew pairings,” Computers & Operations Research, Vol. 29, No. 4, pp. 341-363, 2002.
[99] Yunes T., Moura A. V., and De Souza C. C., “Hybrid Column Generation Approaches for Urban Transit Crew Management Problems,” Transportation Science. Vol. 39, No. 2, pp. 273-288, 2005.
[100] 台北捷運路網圖及各站資訊，民國104年1月29日，取自台北大眾捷運股份有限公司網頁：http://www.metro.taipei/ct.asp?xItem=78479152&CtNode= 70089&mp=122035
[101] 台北都會區捷運建設願景圖，民國104年2月11日，取自台北市政府捷運工程局網頁：http://www.dorts.gov.taipei/public/MMO/dortsc_media/00linkicon/ dorts_wish_map.jpg
[102] 台北市各行政區最新月份人口數，民國104年1月，取自台北市政府民政局：http://www.ca.taipei.gov.tw/ct.asp?xItem=1503254&ctNode=41896&mp= 102001
[103] 江俐諭，「捷運司機員輪值問題之研究─以台北捷運公司為例」，國立交通大學，碩士論文，民國95年。
[104] 大眾捷運法，民國103年6月，取自法務部全國法規資料庫：http://law.moj.gov.tw/LawClass/LawAll.aspx?PCode=K0120001
[105] 高雄市戶籍人口統計查詢，民國104年1月，取自高雄市政府民政局：http://cabu.kcg.gov.tw/Report/ReportTypeFile.aspx?id=92&menuid=183
[106] 高雄捷運紅橘線與環狀輕軌規畫圖，民國104年1月，取自高雄市政府捷運工程局：http://mtbu.kcg.gov.tw/cht/project_LRT_circle.php
[107] 高雄捷運營運系統圖，民國104年1月，取自高雄捷運股份有限公司：http://www.krtco.com.tw/images/newInnerSite/guide/KRTC%20Route%20map_Chinese.pdf
[108] 黃錫鏗，「捷運系統人力配置模式之研究─以高雄捷運公司司機員為例」，國立中山大學，碩士論文，民國91年。
[109 新北市人口統計，民國104年1月，取自新北市政府民政局：http://www.ca.ntpc.gov.tw/Population/List?wnd_id=68
[110] 韓復華，休假排班及其人力需求規劃決策支援系統雛形建立，行政院國家科學委員會專題研究計畫成果報告，民國84年。
[111] 韓復華、李俊德，「兩階段限制規劃模式求解護理人員輪值問題」，管理與系統，第十四卷第一期，121-146頁，民國96年1月。
[112] 韓復華、李俊德，「限制規劃與整數規劃模式應用之比較：以捷運站務人員輪值問題為例」，運輸學刊，第二十卷第三期，229-254頁，民國97年9月。
[113] 蘇昭旭，世界捷運與輕軌圖鑑，人人出版股份有限公司，民國98年。

 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
無相關博士論文
 
無相關書籍
 
無相關著作
 
無相關點閱
 
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：403（臺灣：395，外國：8） ／ 本年度總使用人次：2541260 ／ 訪客人次（自102年09月）：68345284
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上