| 研究生: |
黃雯姬 Huang, Wun-Chi |
|---|---|
| 論文名稱: |
具規模經濟之軸輻式網路設計 The hub-and-spoke network design problem with economies of scale |
| 指導教授: |
林正章
Lin, Cheng-Chang |
| 學位類別: |
碩士 Master |
| 系所名稱: |
管理學院 - 交通管理科學系 Department of Transportation and Communication Management Science |
| 論文出版年: | 2005 |
| 畢業學年度: | 93 |
| 語文別: | 中文 |
| 論文頁數: | 55 |
| 中文關鍵詞: | 規模經濟 、網路 、軸輻式 |
| 外文關鍵詞: | hub-and-spoke, network, H/S, economies of scale |
| 相關次數: | 點閱:105 下載:3 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
摘要<br>
規劃一個有效率、高品質的運輸系統,首先要構建一個適當的營運網路,以往的營運網路採用起點與迄點間的直接網路(direct network)運輸,然而此種營運模式,因每一運具的承載率低,故所耗用的運具較多。因此而有軸輻式網路(hub-and-spoke network)的提出,軸輻式網路(hub-and-spoke, H/S)的結構提供人流或物流於中繼站轉運的功能,替代運具低承載率的高運輸成本。
軸輻式網路於實務作業的應用上,由最初期的純軸輻式網路(pure Hub-and-Spoke,H/S),逐漸隨著業者實務性的需求,而有層級式軸輻式網路(hierarchical H/S)、單向裝或卸具軸輻式(H/S with one-directed stopovers)、沿途裝卸軸輻式(stopovers network)以及含分支之軸輻式(stopovers with feeders network)等型態。
軸輻式網路中,中繼站之轉運成本具有規模經濟特性,達到旅客或貨物運輸業者經營的總營運成本最小化。因此軸輻式網路的結構,被廣泛的應用於旅客或貨物的路面與航空運輸以及通訊業中。
本研究之網路,為具規模經濟特性之軸輻式網路,在服務網路中,存在一個以上的場站(depot),在單一週期內服務區內之需求,每架飛機在該週期內只能服務一條路線,並且在整個配送過程中不能違反時窗限制及容量限制的情況下,求業者之成本最小化或利潤最大化。
本研究以FedEX Express國際快遞公司及台南市區公車為例,首先構建具規模經濟特性之營運網路,並依其網路架構數學模式。以frank-wolfe algorithm 線性化成本函數,並以以商用軟體ampl呼叫cplex求解數學模式。
最佳規劃共需14 班MD-11 型飛機及8班A310型飛機,運輸成本929,242 美元,轉運成本為400,049美元,故總成本為1,329,291 美元。中繼轉運站之轉運量分別為,蘇比克灣:672,808磅、台北221,568磅以及東京248,137磅。台南市區公車方面,則為一小時可節省430.672元/小時。
Abstract<p>
Before planning a transportation system with efficiency and high quality,,we should construct a suitable operational network. Former operational network uses direct network between origin and destination. However , the direct network is proposed because transport means having low load-factor, this pattern needs more fleet. The hub-and-spoke network provides passengers and cargo transfer function in hubs to substitute low load-factor modal which has expensive transportation cost.
There are several types of H/S network. Application of the hub-and-spoke network, from the type of pure hub-and-spoke during the initial period becomes to types hierarchical H/S, H/S with one-directed stopovers, stopovers network and stopovers with feeders network because of need of carriers.
Within the hub-and-spoke network,transfer cost of hubs has characteristics of economies of scale to make carriers minimize their total operational cost. Therefore, the construction of the hub-and-spoke network is applied in land and air transportation of passengers and cargo and in telecommunication industry.
In this research, the definition of the H/S network is : there are more than one depot and we need to satisfy all needs in the H/S network during single cycle and each aircraft can provide service on only one route and this H/S network cannot violates limitation of time windows and volume. According to limitation above, we try to minimize the carriers’ cost.
Take FedEX Express and the bus network in Tainan city for example. Optimize his hub-and-spoke network design problem with economies of scale. At first, construct the hub-and-spoke network design problem with economies of scale, and then according to its network to construct the mathematical model. Use frank-wolfe algorithm to linearize the cost function and use “ampl” to solve the mathematical model.
The optimization needs 14 MD-11 aircrafts and 8 A310 aircrafts,and the transportation cost is 929,242 US dollar, transfer cost is 80,263 US dollar,and total cost is 1,009,505 US dollar. The amount that transfers in hubs is : Subic Bay,682,808 pounds; Taipei 221,568 pounds and Tokyo 248,137pounds. In the bus network in Tainan city, we can save 430.672 dollars per hour.
參考文獻
【中文部分】
1. 王怡真,「國際快遞業一般化航空網路設計之研究」,國立成功大學交通管理科學系碩士論文,民國92年6月。
2. 林裕人,「國際快遞業航空網路設計之研究」,國立成功大學交通管理科學系碩士論文,民國89年6月。
3. 許巧鶯、王志清,「軸輻航空網路之直運與轉運路線選擇」,運輸計畫季刊,第二十六卷,第一期,民國86年3月。
4. 曾俊傑,「撥召公車路線設計之研究」,國立交通大學交通運輸研究所碩士論文,民國81年6月。
【英文部分】
1. Akyilmaz, M.O. (1994) “An algorithmic framework for routing LTL shipments,” Journal of Operation Research Society, 45(5), 529-538.
2. Avishai, C., Oneximo, G., and Hugo, G. (2002) “Design of bus routes-methodology and the Santo Domingo Case,” Transportation Research Record, 1791, p35-43.
3. Aykin, T. (1995) “Networking policies for hub-and-spoke systems with application to the airport system,” Transportation Science, 29(3), 201-221.
4. Barnhart, C. and Schneur, R.R. (1996) “Air network design for express shipment service,” Operation Research, 44(6), 852-863.
5. Bodin, L., B. Golden, A. Assad, and M. Ball, “ Routing and Scheduling of Vehicles
6. Bryan, D.L. and O’Kelly M.E. (1999) “Hub-and-spoke networks in air transportation: An analytical review,” Journal of Regional Science, 39(2),275-295.
7. Cheng Chang Lin and Sheu Hua Chen(2002) “ A generalized hub-and-spoke network design problem,”The sixteenth triennial conference of the international federation operational research societies,Edinburgh,UK.
8. Chestler, L. (1985) “Overnight airport express: spatial pattern, competition and the future of small package delivery services,” Transportation Quarterly, 39, 59-71.
9. Current, J.R. (1988) “The design of hierarchical transportation network with transshipment facilities,” Transportation Science, 22(4), 270-277.
10. Current, J.R. et al. (1986) “The hierarchical network design problem,” European Journal of Operation Research, 27, 57-66.
11. Eckstein, J. and Sheffi, Y. (1987), “Optimization of group line-haul operations for motor carriers using twin trailers,”Transportation Research Record, 1120, 12-23.
12. Kuby, M.J. and Gray, R.G., (1993), “The hub network design problem with stopovers and feeders: The case of Federal Express,” Transportation Research A, 27, 1-12
13. Leung, J.M., T.L. Magnanti, and V. Singhal (1990), “Routing in point-to-point delivery system: formulations and solution heuristic,” Transportation Science, 24(4), 245-260.
14. Lin, C.-C. (2001a)“The freight routing problem of time definite freight delivery common carriers,” Transportation Research B, 35(6), 525-547.
15. Nikolakopoulou, G., Kortesis, S., Synefaki, A., and Kalfakakou, R. (2004) “Solving a vehicle routing problem by balancing the vehicles time utilization,” European Journal of Operation Research, 520-527.
16. Paolo, T. and Daniele V. (1999) “A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls,” European Journal of Operation Research, 528-543.
17. Tarantili, C.D., Kiranoudis, C.D., and Vassiliadis, V.S. (2004) “A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem,” European Journal of Operation Research, 148-158.
18. Yan, S.-Y. and Chen H.-L. (2002) “A scheduling model and a solution algorithm for inter-city bus carriers ,” Transportation Research Part A, 805-825.