| 研究生: |
王泓達 Wang, Hung-Da |
|---|---|
| 論文名稱: |
台灣高鐵團體旅客車廂與座位配置之研究 The car and seat arrangement for group passengers in Taiwan high speed rail |
| 指導教授: |
鄭永祥
Cheng, Yung-Hsian |
| 學位類別: |
碩士 Master |
| 系所名稱: |
管理學院 - 交通管理科學系 Department of Transportation and Communication Management Science |
| 論文出版年: | 2013 |
| 畢業學年度: | 101 |
| 語文別: | 中文 |
| 論文頁數: | 162 |
| 中文關鍵詞: | 鐵路運輸 、旅客滿意度 、團體旅客 、座位分配 、規則式系統 |
| 外文關鍵詞: | railway transportation, customer satisfaction, group passengers, seat arrangement, rule-based system |
| 相關次數: | 點閱:127 下載:28 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
本研究探討的是台灣高鐵處理團體旅客之車廂與座位配置問題,由於團體旅客具有人數規模、需求提早出現、起訖站相同以及希望編排到鄰近座位等特性,因此車廂與座位配置的連續性與適當程度很容易影響團體旅客的搭乘滿意度。過去文獻多針對訂位問題提出最佳化方法來使營收效率增加,在訂位接受後之座位配置問題著墨較少,但以企業長期經營目標來看旅客滿意度與營運效率應是重要參考指標,適當座位安排讓旅客以相同價格得到與過去經驗較好之服務,長遠來看能加強與旅客之關係。本研究利用最佳化問題概念將座位配置流程分為二階段,以裝箱問題建構車廂選擇,以集合包裝問題建構座位配置,並利用規則式系統求解方法設計不同訂位之處理順序,藉由系統判斷選擇適合各車廂之訂位,並在座位配置時區分團體與單人,減少各旅客間之分配衝突,讓上下車擁擠與干擾狀況減低,增加列車營運效率與滿足不同旅次目的與訂位特性旅客之配置期望。
This study takes the car and seat arrangement as problem regarding group passengers in THSR (Taiwan High Speed Rail). According to the characteristics of group passengers, different car and seat arrangements and continuity would affect their satisfaction. For those past literature, they always proposed optimized method to handle reservation but less discussed about the seat arrangement, which might play an important role to fit the requirement of all passengers. Appropriate seat arrangement can be recognized as a god service so as to enhance the relationship between company and travelers. The concept of seat arrangement process is divided into two steps, by applying the bin packing problem (BPP) to construct a module to choose compartment, following by set packing problem (SPP) to formulate seat arrangement. Alike the rule-based system (RBS), a problem-solving technique has been developed to cope with difficult and complicated cases while selecting car and seat arrangement. The RBS model with wide range to cover reservation groups, instant group and even single passengers its benefits are expected to handle all problems at the same time, including conflict of allocation, crowded and interfered while getting on/off the train. The RBS model can increase the operating efficiency and satisfy various requirements so as to provide criteria for a large number of group demands in the coming future.
1. Altman, I. (1975). “The environment and social behavior (p. 46).” Monterey, CA: Brooks/Cole.
2. Baldi, M. M., Crainic, T. G., Perboli, G., & Tadei, R. (2012). “The generalized bin packing problem.” Transportation Research Part E: Logistics and Transportation Review, 48(6), 1205-1220.
3. Banerjee, P. K., & Turner, T. R. (2012). “A flexible model for the pricing of perishable assets.” Omega, 40(5), 533-540.
4. Bharill, R., & Rangaraj, N. (2008). “Revenue management in railway operations: A study of the Rajdhani Express, Indian Railways.” Transportation Research Part A: Policy and Practice, 42(9), 1195-1207.
5. Boyar, J., Krarup, S., & Nielsen, M. N. (2004). “Seat reservation allowing seat changes.” Journal of Algorithms, 52(2), 169-192.
6. Boyar, J., & Larsen, K.S. (1999). “The Seat Reservation Problem.” Algorithmica, 25, 403-417.
7. Boyar, J., & Medvedev, P. (2004). “The Relative Worst Order Ratio Applied to Seat Reservation.” Scandinavian Workshop on Algorithm Theory.
8. Buttin, K.J., & Swann, D. (1992). “Transatlantic lessons in aviation deregulation: EEC and US experiences.” Antitrust Bulletin, 37, 207-255.
9. Chen, S. G., Guillermo, L., Michael Z. F., & Lin, B. (2010). “Optimal seat allocation for two-flight problems with a flexible demand segment.” European Journal of Operational Research, 201(3), 897-908.
10. Clausen, T., Hjorth, A. N., Nielsen, M., & Pisinger, D. (2010). “The off-line group seat reservation problem.” European Journal of Operational Research, 207(3), 1244-1253.
11. Crainic, T. G., Perboli, G., Rei, W., & Tadei, R. (2011). “Efficient lower bounds and heuristics for the variable cost and size bin packing problem.” Computers & Operations Research, 38(11), 1474-1482.
12. Delorme, X, Gandibleux, X., & Rodriguez, J. (2004). “GRASP for set packing problems.” European Journal of Operational Research, 153(3), 564-580.
13. Feng, Y., & Xiao, B. (2006). “A continuous-time seat control model for single-leg flights with no-shows and optimal overbooking upper bound.” European Journal of Operational Research, 174(2), 1298-1316.
14. Gibson, S. (2003). “Allocation of capacity in the rail industry.” Utilities Policy, 11(1), 39-42.
15. Haouari, M., & Serairi, M. (2009). “Heuristics for the variable sized bin-packing problem.” Computers & Operations Research, 36(10), 2877-2884.
16. Helliesen, A. (2003). “The Seat Reservation Problem – An Empirical Study.” Technical University of Denmark, Master Thesis.
17. Kang, J., & Park, S. (2003). “Algorithms for the variable sized bin packing problem.” European Journal of Operational Research, 147, 365-372.
18. Kimes, S. E. (1999). “The Relationship Between Product Quality and. Profitability at Holiday.” Journal Of Service Research, 2(2), 138-144.
19. Kimes, S. E., & Writz, J. (2002). “Perceived fairness of Demand-Based Pricing for Restaurants.” The Cornell HRAQ, 41(1), 31-38.
20. Kohrt, J. S., & Larsen, K. S. (2004). “On-line seat reservations via off-line seating arrangements.” International Journal of Foundations of Computer Science.
21. Li, F., Tian, C., Zhang, H., & Kelley, W. (2010). “Rule-based optimization approach for airline load planning system.” Procedia Computer Science, 1(1), 1455-1463.
22. Lindenmeier, J., & Tscheulin, D. K. (2008). “The effects of inventory control and denied boarding on customer satisfaction: The case of capacity-based airline revenue management.” Tourism Management, 29(1), 32-43.
23. Lodi, A., Martello, S. , & Monaci, M. (2002). “Two-dimensional packing problems A survey.” European Journal of Operational Research, 141, 241-252.
24. Nathanail, E. (2008). “Measuring the quality of service for passengers on the hellenic railways.” Transportation Research Part A: Policy and Practice, 42(1), 48-66.
25. Park, C., & Seo, J. (2011). “Seat inventory control for sequential multiple flights with customer choice behavior.” Computers & Industrial Engineering, 61(4), 1189-1199.
26. Smith, B., Leimkuhler, J., Darrow, R., & Samuels, J. (1992). “Yield Management at American Airlines.” Interfaces, 1, 8-31.
27. Stokols, D. (1972).” On the distinction between density and crowding: Some implications for future research.” Psychological review, 79(3), 275-277.
28. Sumalee, A., Tan, Z., & Lam, W. H. K. (2009). “Dynamic stochastic transit assignment with explicit seat allocation model.” Transportation Research Part B: Methodological, 43(8-9), 895-912.
29. Tajima, A., & Misono, S. (1999). “Using a set packing formulation to solve airline seat allocation,reallocation problems.” Journal of the Operations Research Society of Japan, 42(1).
30. Tian , C. , Zhang, H. , Li, F., & Liu, T. (2009). “Air Cargo Load Planning System: a Rule-based Optimization Approach.” Service Operations, Logistics and Informatics, 454-459.
31. Van den Briel, M. H., Villalobos, J. R., Hogg, G. L., Lindemann, T., & Mulé, A. V. (2005). “America west airlines develops efficient boarding strategies. “ Interfaces, 35(3), 191-201.
32. Vulcano, G., Ryzin, G., & Chaar, W. (2009). “OM Practice--Choice-Based Revenue Management: An Empirical Study of Estimation and Optimization.” Manufacturing & Service Operations Management, 12(3), 371-392.
33. Weatherford, L. R., & Bodily, S. E. (1992). “A taxonomy and research overview of perishable-asset revenue management: revenue management, overbooking pricing.” Operations Research, 40(5), 831-844.
34. Writz, J., Kimes, S.E., Ho P. T., & Patterson, P. (2003). “Revenue Management: Resolving potential customer conflicts.” Journal of Revenue and Pricing Management, 2(3), 216-226.
35. Yang, C. W., & Chang, C. C. (2011). “Applying price and time differentiation to modeling cabin choice in high-speed rail.” Transportation Research Part E: Logistics and Transportation Review, 47(1), 73-84.
36. Yannakakis, M. , & Gavril, F. (1987). “The maximum k-colorable subgraph problem for chordal graphs.” Information Processing Letters, 24, 133-137.