Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5324
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor郭瑞祥(Andy Ruey-Shan Guo,)
dc.contributor.authorYi-Cheng Changen
dc.contributor.author張易晟zh_TW
dc.date.accessioned2021-05-15T17:55:58Z-
dc.date.available2015-07-11
dc.date.available2021-05-15T17:55:58Z-
dc.date.copyright2014-07-11
dc.date.issued2014
dc.date.submitted2014-07-07
dc.identifier.citation1. 李子路 (2011),電子商務環境下生鮮農產品的家庭配送模式及配送模型研究,重慶大學企業管理研究所碩士論文。
2. 谷口榮一、胡祥培、黃敏芳、李永先譯 (2011),城市物流:網路建模與智慧交通系統,北京:電子工業出版社。
3. 阮石磊 (2008),B2C電子商務企業物流模式及車輛調度研究,東北大學企業管理研究所碩士論文。
4. Altınel, İ. K., & Oncan, T. (2005). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society, 56(8), 954-961.
5. Baker, E. K. (1981). Efficient heuristic algorithms for the weighted set covering problem. Computers & Operations Research, 8(4), 303-310.
6. Caprara, A., Toth, P., & Fischetti, M. (2000). Algorithms for the set covering problem. Annals of Operations Research, 98(4), 353-371.
7. Chopra, S. (2003). Designing the distribution network in a supply chain. Transportation Research Part E: Logistics and Transportation Review, 39(2), 123-140.
8. Clarke, G. u., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.
9. Coppel, J. (2000). E-commerce: impacts and policy challenges, OECD Economic Outlook, No. 67, Organization for Economic Co-operation and Development, Paris, France.
10. Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
11. Daskin, M. S., & Stern, E. H. (1981). A hierarchical objective set covering model for emergency medical service vehicle deployment. Transportation Science, 15(2), 137-152.
12. Drezner, Z., & Hamacher, H. W. (2004). Facility location: applications and theory, New York: Springer.
13. eMarketer. (2013). Global B2C Ecommerce Sales to Hit $1.5 Trillion This Year Driven by Growth in Emerging Markets, Retrieved Feb 3, 2014, http://www.emarketer.com/Article/Global-B2C-Ecommerce-Sales-Hit-3615-Trillion-This-Year-Driven-by-Growth-Emerging-Markets/1010575/7
14. Farahani, R. Z., Asgari, N., Heidari, N., Hosseininia, M., & Goh, M. (2012). Covering problems in facility location: A review. Computers & Industrial Engineering, 62(1), 368-407.
15. Gaskell, T. (1967). Bases for vehicle fleet scheduling. Operational Research, 18(3), 281-295.
16. Hesse, M. (2008). The city as a terminal: The urban context of logistics and freight transport, Burlington, Vermont: Ashgate.
17. Jones Lang LaSalle (2013). E-commerce boom triggers transformation in global e-commerce and retail logistics, Retrieved May 25, 2014, http://www.jll.com/Research/eCommerce_boom_triggers_transformation_in_retail_logistics_whitepaper_Nov2013.pdf
18. Kulkarni, R., & Bhave, P. R. (1985). Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 20(1), 58-67.
19. Lan, G., DePuy, G. W., & Whitehouse, G. E. (2007). An effective and simple heuristic for the set covering problem. European Journal of Operational Research, 176(3), 1387-1403.
20. Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408-416.
21. Lee, H. L., & Whang, S. (2001). Winning the last mile of e-commerce. MIT Sloan Management Review, 42(4), 54-62.
22. Love, R. F., Morris, J. J., & Wesolowsky, G. O. (1988). Facilities location, New York: North-Holland Amsterdam.
23. McDonald, J. (1972). Vehicle Scheduling- A case study. Operational Research Quarterly, 23(4), 433-444.
24. Miller, T. C. (2002). Hierarchical operations and supply chain planning, New York: Springer.
25. Minieka, E. (1970). The m-center problem. Siam Review, 12(1), 138-139.
26. Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649-672.
27. Nemoto, T., Visser, J., & Yoshimoto, R. (2001). The impact of e-commerce on transport, OECD/ECMT Joint Seminar, Organization for Economic Co-operation and Development, Paris, France.
28. Owen, S. H., & Daskin, M. S. (1998). Strategic facility location: A review. European Journal of Operational Research, 111(3), 423-447.
29. Paessens, H. (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34(3), 336-344.
30. Perl, J., & Daskin, M. S. (1985). A warehouse location-routing problem. Transportation Research Part B: Methodological, 19(5), 381-396.
31. Poot, A., Kant, G., & Wagelmans, A. P. M. (2002). A savings based method for real-life vehicle routing problems. Journal of the Operational Research Society, 53(1), 57-68.
32. Potvin, J., Lapalme, G., & Rousseau, J. (1989). A generalized k-opt exchange procedure for the MTSP. INFOR, 27(4), 474-481.
33. Pyke, D. F., Johnson, M. E., & Desmond, P. (2001). E-fulfillment. Supply Chain Management Review, 27.
34. Rand, G. K. (2009). The life and times of the savings method for vehicle routing problems. ORiON: The Journal of ORSSA, 25(2), 125-145.
35. Taniguchi, E., Fwa, T. F., & Thompson, R. G. (2013). Urban transportation and logistics: health, safety, and security concerns, Boca Raton: CRC Press.
36. Toregas, C., Swain, R., ReVelle, C., & Bergman, L. (1971). The location of emergency service facilities. Operations Research, 19(6), 1363-1373.
37. Vigo, D. (1996). A heuristic algorithm for the asymmetric capacitated vehicle routing problem. European Journal of Operational Research, 89(1), 108-126.
38. Walker, W. (1974). Using the set-covering problem to assign fire companies to fire houses. Operations Research, 22(2), 275-277.
39. Yellow, P. (1970). A computational modification to the savings method of vehicle scheduling. Journal of the Operational Research Society, 21(2), 281-283.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5324-
dc.description.abstract近年來全球B2C電子商務銷售額成長顯著,使得電商接觸消費者的最後一哩─配送物流日趨重要,為了強化競爭優勢與區隔目標客群,更加重視都會區中高度集中的消費者與嚴格配送時間的特性,B2C電商開始建置車隊與相關設施,降低車輛裝載率以快速且密集的配送方式為創新競爭策略滿足顧客需求。
本研究之目的為B2C電商提出發展自有配送系統之最適化設施數、設施位置與車輛數。然而過去B2C電子商務與物流及配送模型設計相關文獻,常在考慮車輛實際容量、最長路徑限制與顧客服務時間等因素下,以最低成本做為衡量設施區位問題與車輛途程問題的績效指標,但在B2C電子商務的策略中,具時效性的衡量指標如準時送達率更是重要。
考慮設施位置對於車輛路徑的顯著影響下,建構兩階段之區位途程問題為B2C電商提供設施數量、設施位置及車輛數之建議,分別在給定服務策略下以分支界限法求解最小化服務都會區之設施數,並選擇訂單數較多的區域設立設施,接續以時間導向之循序型節省法求解每座設施所需之最少車輛數。
以國內知名B2C電商企業之訂單資料為研究對象,探討不同配送策略對於最佳設施數量、位置、最少車輛數與旅行時間之影響,並調整相關參數提出不同配送策略下之方案組合,提供決策者多方考量配送模型的發展與策略,做為初步規劃之建議,協助電商企業發展具配送時效導向的競爭策略,使得電商能夠更緊密的虛實整合,為都會區中的潛在消費者們提供最佳的服務。
zh_TW
dc.description.abstractWith the significant growth of B2C e-commerce in the recent years, “The Last Mile” is essential for e-commerce to serve customers. To enhance competitive advantages and separate target segments, Firms have paid attention to the characteristics of high customer density in a metropolitan area and hard delivery time windows have been given great attention. B2C e-commerce firms have begun to build distribution systems, and reduce the loading rate with frequently delivery schedules to be creative competitive strategies.
The purpose of this research is to provide the optimal suggestions for B2C e-commerce firms to manage their distribution systems. The previous literature related to B2C e-commerce and logistics, and distribution model design asserts that cost efficiency is considered measurement of the performance associated with facility locations and vehicle routing problems. Additionally, performance also includes factors such as vehicle capacity, maximum route length and customer service time. More specifically, the strategies of B2C e-commerce distribution emphasize the integration the above factors into time-oriented indicators to measure their service quality.
By building a two-stage location-routing problem for B2C e-commerce to provide the scenarios for the required number of facilities and fleet size as well as the facility locations. The first stage is applying the branch and bound method to minimizing the number of facilities and corresponding locations. In the second stage, this research utilizes time-oriented savings method with sequential approach to minimize fleet size in each facility.
This research draws data from a B2C e-commerce enterprise to investigate the optimal combinations among the required number of facilities and fleet size as well as the facility locations. The findings in this research provide the managers a comprehensive and multiple aspects model for developing logistics systems in a metropolitan area. This paper also conduct sensitive analysis to provide different portfolios that managers can take into considerations to further develop their businesses and enhance service quality.
en
dc.description.provenanceMade available in DSpace on 2021-05-15T17:55:58Z (GMT). No. of bitstreams: 1
ntu-103-R01546009-1.pdf: 1764968 bytes, checksum: c28c41e98b68e999aa2c2e7510f5042b (MD5)
Previous issue date: 2014
en
dc.description.tableofcontents摘要 I
ABSTRACT II
目錄 IV
圖目錄 VI
表目錄 VII
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 3
1.3 研究架構 3
1.4 論文架構 4
第二章 文獻探討 6
2.1 B2C電子商務與物流 6
2.2 城市物流 7
2.3 配送模型 8
2.3.1 區位途程問題(Location routing problem, LRP) 10
2.3.2 設施區位問題(Facility location problem, FLP) 12
2.3.3 車輛途程問題(Vehicle routing problem, VRP) 15
2.3.4 節省法(Savings method) 15
2.4 文獻整理與評析 18
第三章 模型建構 20
3.1 問題描述 20
3.2 模型假設 23
3.3 數學模型 24
3.3.1 模型架構 24
3.3.2 權重集合覆蓋問題 25
3.3.3 求解方法 27
3.3.4 區域指派機制 28
3.3.5 求解方法 29
3.3.6 車輛途程問題 30
3.3.7 求解方法 31
第四章 個案資料分析 38
4.1 個案背景介紹 38
4.2 個案參數設定 40
4.2.1 估計服務時間 40
4.2.2 估計旅行時間矩陣 42
4.3 個案資料求解 45
4.3.1 權重集合覆蓋問題 45
4.3.2 區域指派機制 47
4.3.3 車輛途程問題 48
4.3.4 非對稱型節省法 48
4.3.5 對稱型節省法 51
4.4 求解結果 53
4.5 敏感度分析 54
4.5.1 調整最長服務時間 54
4.5.2 延長配送時間上限 57
4.6 小結 59
第五章 結論與建議 61
5.1 研究結論與管理意涵 61
5.2 研究貢獻 61
5.3 研究限制 62
5.4 未來研究方向 63
參考文獻 64
dc.language.isozh-TW
dc.titleB2C電子商務下都會區配送模型之研究zh_TW
dc.titleB2C E-commerce Distribution Models in a Metropolitan Areaen
dc.typeThesis
dc.date.schoolyear102-2
dc.description.degree碩士
dc.contributor.coadvisor蔣明晃(David Ming-Huang Chiang)
dc.contributor.oralexamcommittee洪一薰(I-Hsuan Hong),吳政鴻(Cheng-Hung Wu)
dc.subject.keywordB2C電子商務物流,配送模型,區位途程問題,節省法,zh_TW
dc.subject.keywordB2C E-commerce Logistics,Distribution Model,Location-Routing Problem,Savings Method,en
dc.relation.page66
dc.rights.note同意授權(全球公開)
dc.date.accepted2014-07-07
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept工業工程學研究所zh_TW
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-103-1.pdf1.72 MBAdobe PDF檢視/開啟
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved