簡易檢索 / 詳目顯示

研究生: 施乃文
Shih, Nai-Wen
論文名稱: 結合點對點及軸幅式網路之混合式都會區機車快遞網路之營運機制研究
Motorcycle courier systems based on hybrid hub-and-spoke and point-to-point schemes in metropolitan area
指導教授: 王逸琳
Wang, I-Lin
學位類別: 碩士
Master
系所名稱: 管理學院 - 工業與資訊管理學系
Department of Industrial and Information Management
論文出版年: 2010
畢業學年度: 98
語文別: 中文
論文頁數: 74
中文關鍵詞: 機車快遞點對點網路軸幅式網路
外文關鍵詞: Motorcycle courier system, Hub and Spoke, Point to Point
相關次數: 點閱:97下載:12
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 機車的高機動性導致都會區之機車快遞業逐漸興起,先前的研究結果顯示新興的軸幅式(Hub and Spoke,HS)機車快遞營運網路比傳統的點對點式(Point to Point,PP)機車快遞營運網路更具經濟效益及高服務水準。雖然HS式網路之Hub具有優越的交換信件功能,但其建置成本卻十分昂貴。為了因應Hub可能產生的高建置成本,並替Hub在喪失營運功能時的整體營運應變措施作準備,本研究擬探討HS網路設計採用無Hub或分散Hub風險的方式,在不變更各分區之營運下的應變營運措施。我們將參考PP網路的營運方式,提出環式(RPP)、弧式(APP)交換型PP網路,以及扇式(FHS)、衛星(SHS)交換型HS網路等數種新的混合式分區信件交換機制,以取代或弱化原Hub的信件交換功能。此外,我們考慮各送件員在不同模式中的收送件負載量,分析各機制下的成本、一日總送件量和送件服務水準,以原HS網路模式為標竿進行各項績效指標的分析比較,並根據結果與不同的情境狀況,找出最推薦的機車快遞營運機制。

    本研究結果顯示,假若企業於都會區面臨Hub難以取得、Hub租金高昂等問題,則採用RPP/APP網路可達到與HS網路差異不大的總送件量與平均送件時間;而若企業期望能達到較多的總送件量,則建議採用FHS/SHS網路;此外,當工作人員的收送件能力限制列入考慮時,則SHS網路能達成較多的總送件量但同時亦需付出較多的成本。

    Motorcycle courier systems have become an efficient means to deliver small packages in metropolitan areas due to its high mobility and low hardware investment on vehicles. Although the Hub and Spoke (HS) courier networks are shown to complete more consignments and provide better service than the Point to Point (PP) courier networks, the high utilization and dependence on the Hub increases the risk and fixed cost investment. In order to find suitable courier networks that are cheaper and less risky than HS but more efficient than PP, this thesis proposes four hybrid courier networks based on balancing the pros and cons of HS and PP networks. All of these four networks hire transhippers and consignees, where each service zone is served by a consignee who stays in his zone all the time to collect and deliver consignments, while a transhipper takes charge of one or more service zones by transhipping consignments between these zones.
    Two PP-like networks, denoted by RPP and APP, are designed as variants of hybrid PP networks, in which a transhipper travels to an adjacent zone either following the same orientation (i.e. a ring-like traversal) or alternatively following different orientations (i.e. an arc-like traversal). On the other hand, two HS-like networks that exploit smaller hubs, denoted by FHS and SHS, are designed as variants of hybrid HS networks. In FHS, a transhipper traverses along a fan-like orientation by visiting a few zones, returning the Hub to exchange consignments, and then going back to his first zone. In SHS, several service zones are grouped as a satellite HS system, and all the satellite hubs exchange consignments in a central Hub.
    We analyze the theoretical total cost and amount of delivered consignments within a given service time limit and entire day, whether considering the employee’s capacity or not, for each of the four hybrid courier networks. Computational experiments are conducted with different settings on the number of service zones and employee’s capacity. The results indicate that both RPP or APP may give total amount of delivered consignments and average delivery time similar to HS. FHS and SHS give more total amount of delivered consignments than HS. Moreover, when further considering the employee’s capacity, SHS can deliver more consignments but it also comes with higher cost.

    誌謝 i 摘要 ii Abstract iii 表目錄 ix 圖目錄 xi 第一章 緒論 1 1.1 研究動機 1 1.2 研究目的 3 1.3 論文架構 3 第二章 文獻探討 5 2.1 點對點網路(Point to Point,PP) 6 2.1.1 點對點網路架構 6 2.1.2 點對點網路之實務應用 6 2.2 軸輻式網路(Hub and Spoke,HS) 8 2.2.1 軸幅式網路架構 8 2.2.2 軸幅式網路之實務應用 9 2.3 點對點網路與軸幅式網路之比較 11 2.4 小結 14 第三章 改良式PP網路 15 3.1 模式基本假設 15 3.1.1 研究限制與假設 16 3.2 環式交換型PP網路 17 3.2.1 無負載量上限之環式交換型PP網路 18 3.2.2 有負載量上限之環式交換型PP網路 22 3.3 弧式交換型PP網路 26 3.3.1 無負載量上限之弧式交換型PP網路 27 3.3.2 有負載量上限之弧式交換型PP網路 32 3.3.3 PP網路 34 3.3.4 無負載量上限之PP網路 34 3.3.5 負載量上限之PP網路 35 3.4 小結 35 第四章 改良式HS網路 36 4.1 扇式交換型HS網路 36 4.1.1 無負載量上限之扇式交換型HS網路 37 4.1.2 有負載量上限之扇式交換型HS網路 40 4.2 衛星交換型HS網路 42 4.2.1 收送件員所觸發之事件動作 44 4.2.2 傳遞員所觸發之事件動作 45 4.3 小結 48 第五章 數值分析 49 5.1 RPP、APP、FHS與HS送件量之比較 50 5.1.1 送件量-無負載量之限制 50 5.1.2 送件量-負載量之限制 51 5.2 RPP、APP、FHS與HS平均送件時間之比較 52 5.2.1 平均送件時間-無負載量之限制 53 5.2.2 平均送件時間-有負載量之限制 55 5.2.3 成本比較 58 5.3 SHS與HS送件量之比較 58 5.3.1 送件量-無負載量之限制 59 5.3.2 送件量-有負載量之限制 59 5.4 SHS與HS平均送件時間之比較 61 5.4.1 平均送件時間-無負載量之限制 62 5.4.2 平均送件時間-有負載量之限制 62 5.4.3 成本比較 65 5.5 小結 65 第六章 結論與未來研究方向 67 6.1 結論 67 6.2 研究成果與貢獻 69 6.3 未來研究方向建議 70 參考文獻 72

    劉姿儀.2008.都會區機車快遞網路之營運機制研究.工業與資訊管理學系碩士論文,國立成功大學
    Alderighi, M., Cento, A., Nijkamp, P. and Rietveld, P. Network competition-the coexistence of hub-and-spoke and point-to-point systems. Journal of Air Transport Management, 11, 328-334, 2005.
    Alderighi, M., Cento, A., Nijkamp, P. and Rietveld, P. Assessment of new huband- spoke and point-to-point airline network configurations. Transport Reviews, 27(5), 529T549, 2007.
    Bartholdi, J. J. and Eisenstein, D. D. A production line that balances itself. Operations Research, 44(1), 21–34, 1996.
    Bryan, D. L. and O’Kelly, M. E. Hub-and-spoke networks in air transportation: An analytical review. Journal of Reginal Science, 39(2), 275-295, 1999.
    Burghouwt, G. and Wit, J. de. Temporal configurations of European airline networks. Journal of Air Transport Management, 11, 185-198, 2005.
    Camargo, R. S. de., Miranda Jr, G., Ferreira, R. P. M. and Luna, H. P. Multiple allocationhub-and-spoke network design under hub congestion. Computers and OperationsResearch, 36, 3097–3106, 2009.
    Elhedhli, S. and Hu, F. Hub-and-spoke network design with congestion. Computers and Operations Research, 32, 1615U1632, 2005.
    Franke, M. Competition between network carriers and low-cost carriers–retreat battle or breakthrough to a new level of efficiency? Journal of Air Transport Management, 10(1), 15-21, 2004.
    Gillen, D. and Lall, A. Competitive advantage of low-cost carriers: some implications for airports. Journal of Air Transport Management, 10(1), 41-50, 2004.
    Gordon, S. and Neufville, R. de. Design of air transportation networks. Transportation Research, 7, 207-222, 1973.
    Graham, M. Different models in different spaces or liberalized optimizations? Competitive strategies among low-cost carriers. Journal of Transport Geography, 17, 306U316, 2009.
    Grove, P. G. and O’Kelly, M. E. Hub network and simulated schedule delay. Papers of the Regional Sciednce Association, 59, 103-119, 1986.
    Hu, Q. 2005. Are hub-and-spoke networks better than point-to-point networks? In Technical memorandum. Department of Operations, Case Western Reserve University, Ohio, USA.
    Leung, J. M. Y., Magnanti, T. L. and Singhal, V. Routing in point-to-point delivery systems: Formulations and solution heuristics. Transportation Science, 24(4), 245-260, 1990.
    Mason, K. J. Observations of fundamental changes in the demand for aviation services. Journal of Air Transport Management, 11(19U25), 2005.
    O’Connell, J. F. and Williams, G. Passengers’ perceptions of low cost airlines and full service carriers: A case study involving Ryanair, Aer Lingus, Air Asia and Malaysia Airlines. Journal of Air Transport Management, 11, 259U272, 2005.
    Pels, E. Network competition in the open aviation area. Journal of Air Transport Management, 15, 83U89, 2009.
    Reynolds-Feighan, A. Traffic distribution in low-cost and full-service carrier networks in the US air transportation market. Journal of Air Transport Management, 7,265-275, 2001.
    Tan, P. and Kara, B. A hub covering model for Cargo delivery systems. Wiley Inter- Science, 2006.
    Wang, I. L. Distribution small packages in metropolitan area by motorcycle courier services. International Journal of Integrated Supply Management, 4(1), 88-101, 2008.
    Yaman, H., Kara, B. and Tansel, B. The latest arrival hub location problem for Cargo delivery systems with stopovers. Transportation Research Part B, 41, 906U919, 2007.

    下載圖示 校內:2013-08-13公開
    校外:2013-08-13公開
    QR CODE