跳到主要內容

臺灣博碩士論文加值系統

(3.233.217.106) 您好!臺灣時間:2022/08/14 14:48
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:蔡裕峰
研究生(外文):Yu-Feng Tsai
論文名稱:軸輻式物流網路區位與途程之啟發式解法
論文名稱(外文):A Heuristic for a Location-Routing Problem under Hub-and-Spoke Logistics etwork Structure
指導教授:林燦煌林燦煌引用關係
指導教授(外文):Tsan-hwan Lin
學位類別:碩士
校院名稱:國立高雄第一科技大學
系所名稱:運輸倉儲營運所
學門:運輸服務學門
學類:運輸管理學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:104
中文關鍵詞:快遞區位途程設施規劃區位途程問題發式演算法軸輻式網路供應鏈物流運輸倉儲
外文關鍵詞:Location-Routing ProblemHeuristicsHub-and-Spoke Network
相關次數:
  • 被引用被引用:7
  • 點閱點閱:473
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:1
傳統的區位與途程的問題,並不考慮物流中心間的轉運特性。而近年來在運輸配送系統的設計上,產生利用合併運輸與轉運方式,透過大量運輸來產生規模經濟效果的軸輻式網路(Hub-and-Spoke Network)設計。因此,結合軸輻式網路特性與區位途程問題的物流決策,乃成為一個有意義的研究課題。
本研究乃以Perl與Daskin(1985)所發展的區位途程模式為基礎,在考慮顧客服務的外部服務網路(亦即供應鏈上下游間的輸配送)外,多加考慮物流中心間的內部營運網路(亦即供應鏈同一層級間的輸配送),建構一個軸輻式物流配送網路系統(O’Kelly,1985),並結合基因演算法與禁忌搜尋法的特性發展一個有效的啟發式演算法。
利用Perl(1983)所測試的九個範例問題,將本(簡化後)演算法與現行其他五種較新的演算法做求解品質的比較,結果發現以程建銘(2001)的基因演算法與本演算法最佳。結果亦發現,在求解較大型的問題時,本演算法的效果較前者好,探究其原因係本研究多了途程內改善的OPT法。
在參數分析中可以發現,當需求點增加時,會使得物流總成本上升;但是當物流中心與供應商數目增加時,因為可以選擇出較好的物流中心與供應商供貨的組合,反而使得物流總成本下降。因此設計一物流配送網路時,不應只考慮物流中心與顧客的區位,應以供應鏈物流網路設計的角度出發,同時考慮供應商、物流中心與顧客三個階層,以獲得最佳物流總成本的設計。
Traditional location-routing problem didn’t take transshipment between same echelons into consideration. However, in the past decade, hub-and-spoke network system has been widely used in a distribution system due to its ability to get scale economy through consolidation and transshipment. Thus, a location-routing problem considering hub-and-spoke network characteristics deserves detailed study.
The research defines the features of the system, first. A mathematical model is then developed. Because the problem is hard to solve in reasonable time, an efficient heuristic combining genetic althorithms and tabu search is designed to solve the problem. Based on test problems from literature (Perl and Daskin, 1985), solution quality of our simplied heuristics is compared with other five research papers. It is found that our heuristcs and Cheng (2001) have the best performance. For large-size problems, our heuristics performs better due to 2-OPT alghoritms in routing moving phase of the heuristic.
From parameter analysis, it is found that logistics cost increases when number of customers increases. However, logistics cost may decrease when the number of DCs and suppliers increases since better locations may be found. It is thus suggested that customers, DCs, and suppliers should be considered in an integral basis when designing a distribution system.
中文摘要i
Abstractii
誌謝iii
目錄iv
表目錄vi
圖目錄vii
第一章 緒論1
1.1 研究背景與動機1
1.2 研究目的3
1.3 研究架構5
1.4 研究範圍與限制7
1.4.1 基本假設7
1.4.2 作業假設8
第二章 文獻回顧9
2.1 軸輻式網路系統9
2.1.1 軸輻式網路系統發展9
2.1.2 軸輻式網路系統型態10
2.1.3 軸心設施型物流中心定義15
2.2 設施區位問題18
2.2.1 傳統設施區位問題18
2.2.2 軸輻式設施區位問題19
2.2.3 軸輻式設施區位與傳統設施區位問題比較22
2.3 區位與途程問題24
2.4 禁忌搜尋法(TABU SEARCH;TS)26
2.4.1 禁忌搜尋法基本模組26
2.4.2 禁忌搜尋法執行架構27
2.5 基因演算法(GENETIC ALGORITHMS;GA)29
2.5.1 基因演算法基本模組30
2.5.2 基因演算法優缺點32
第三章 數學規劃模式與啟發式演算法34
3.1 軸輻式區位途程問題之數學規劃模式34
3.1.1 符號說明38
3.1.2 軸輻式物流中心配送模式40
3.1.3 數學模式說明42
3.2 軸輻式區位途程問題之啟發式演算法44
3.3 演算法初始建構階段-基因演算法的設計45
3.3.1 基因演算法的執行步驟46
3.3.2 軸輻式物流中心區位分派模式演算法51
3.3.3 軸輻式物流中心車輛途程建構模式53
3.4 演算法改善階段-禁忌搜尋法的設計56
3.4.1 移步的決定57
3.4.2 移步值的評估62
3.4.3 禁忌模組的設計64
3.4.4 禁忌搜尋法改善的作業流程68
3.5 影響演算法執行效率的參數分析72
第四章 資料分析75
4.1 啟發式演算法的求解品質測試75
4.2 啟發式演算法的求解品質比較77
4.3 模式參數對於配送決策的影響79
第五章 結論與建議87
5.1 結論與建議87
5.2 未來研究方向89
參考文獻90
中文部分90
英文部分91
中文部分[1] 王璟瑩,1998,應用禁忌搜尋法於物流中心區位選擇之研究,國立雲林科技大學工業工程與管理技術研究所,碩士論文[2] 王保元,1990,物流中心冷涷食品配送模式之研究,朝陽科技大學工業工程與管理系,碩士論文[3] 王俊傑,2000,多物流中心車輛可重覆使用之途程問題研究,國立台灣科技大學工業管理系,碩士論文[4] 白俊偉,1999,隨機性區位-途程問題解法之研究,大葉大學工業工程所,碩士論文[5] 行政院經建會,2001,全球運籌與案例研討,5月[6] 行政院經建會,2000,建構全球運籌中心之政策與法制,7月[7] 吳莉甯,林正章,2000,筆記型電腦業國際供應鏈網路設計之研究,國立成功大學交通管理學系,碩士論文[8] 吳琴玲,2000,物流配送系統之區位-途程研究,國立雲林科技大學工業工程與管理技術研究所,碩士論文[9] 李俊勳、許巧鶯,2000,航空公司貨運網路航線頻次與機型規劃之研究,國立交通大學運輸工程與管理系,碩士論文[10] 林志明、陳春益等,1999,”國內設置貨物轉運中心可行性之研究”,交通部運輸研究所。第二十八卷 第四期,頁535~564,12月[11] 林裕人,林正章,2000,國際快遞業航空網路設計之研究,國立成功大學交通管理系,碩士論文[12] 郭浩然、吳然貴,1999,貨櫃航商對台灣地區港埠選擇條件與靠泊港埠意願關係之研究,國立海洋大學航運管理學系,碩士論文[13] 張斐如、謝尚行,2000,軸輻路網在國際定期貨櫃船航線之應用,國立交通大學交通運輸研究所,碩士論文[14] 倉石俊著,2000,宅急便黑貓探險隊,頁131~133,4月[15] 游芳來,1998,”未來全球樞紐港發展趨勢”,海運月刊,頁2~8,11月[16] 陳春益、林正章等,1999,”國內零擔貨運業設置場站之探討”,交通部運輸研究所[17] 陳惠國、林正章等,2001,運輸網路分析,五南書局,頁35~66,2月[18] 陳春益、林正章,1999,”發展高雄港為國際物流中心之探討”,中華民國運輸學會第十四屆論文研討會論文集,12月[19] 程建銘,2001,多物流中心車輛可重覆使用之區位途程問題研究」,國立台灣科技大學工業管理系,碩士論文[20] 劉志遠、林正章,1999,”路線貨運業貨物整體運輸網路設計之研究”,運輸計劃季刊 第二十八卷 第四期,頁535~564,12月[21] 蕭國洲、許巧鶯,1997,廠商以航空貨運中心為配銷或再加工生產點之研究,國立交通大學交通運輸研究所,碩士論文[22] 顏嘉宏,2000,區位-途程問題啟發式解法之研究,大葉大學工業工程所,碩士論文[23] 蘇雄義,2000,”全球運籌與物流之發展芻議-空運觀點”,頁4~6, 8,16英文部分[1] Aykin, T., 1994, “Larangian Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem,” European Journal of Operational Research, 79, pp.501-523[2] Aykin, T., 1995, “The Hub Location and Routing Problem,” European Journal of Operational Research, 83, pp.200-219[3] Abdinnour-Helm, Sue, 1998, “A Hybrid Heuristics for The Uncapacitated Hub Location problem,” European Journal of Operational Research, 106, pp.486-499[4] Blanton Jr., J. L., and Wainwright R. L., 1993, “Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms,” In Proceeding of the Fifth International Conference on Genetic Algorithms and Their Applications, pp.452-459[5] Bowersox, D.J., Closs D.J., 1996, Logistical Management, The Intergrated Supply Chain Process, McGraw-Hill[6] Campbell, J. F., 1994, “Integer Programming Formulations of Discrete Hub Location problems,” European Journal of Operational Research, 72, pp.387-405[7] Campbell, J.F., 1996, “Hub Location Problems and The p-Hub Median Problem,” Operation Research 44, pp.923-936[8] Current, J. R., 1986, “The Design of a Hierarchical Network Design Problem,” European Journal of Operations Research, 27, pp.57-66[9] Cheng-Chang Line, Jyh-Yeuan Liou, 1999, “The Delivery Network Design Problem of Time-Definite Freight Delivery Common Carriers,” Transportation Planning Journal, Vol.28, No.4, pp.535-564[10] Dohse, Eric D. and Morrison, Kenneth R., 1996, “Using Transportation Solutions for A Facility Location Problem,” Computers Industrial Engineering, pp.63-66[11] Eiichi Taniguchi, Michihiko Noritake, Tadashi Yamada, Toru Izumitani, 1999, ”Optimal Size and Location Planning of Public Logistics Terminals,” Transportation Research Part E, 35, pp.207-222[12] Ernst, Andreas T. and Krishnamoorthy, Mohan, 1996, “Efficient Algorithms for The Uncapacitated Single Allocation p-Hub Median Problem,” Location Science, Vol. 4, No. 3, pp.139-154[13] Glover, F., 1989, “Tabu Search-Part I,” ORSA Journal on Computing, Vol. 1, No. 3, pp.190-206[14] Glover, F., 1990, “Tabu Search-Part II,” ORSA Journal on Computing, Vol. 2, No. 1, pp.4-32[15] Glover, F., Kelly, J., Laguna, M., 1995, “Genetic Algorithms and Tabu Search Hybrids for Optimization,” Computers and Operations Research, 22(1), pp.111-134[16] Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA[17] Hansen, P. H., Hegedahl, B., Hiortkjǽr and Obel, B., 1994, “A Heuristic Solution to The Warehouse Location-Routing Problem,” European Journal of Operational Research, 76, pp.111-127[18] Hall, R. W., 1987, “Direct Versus Terminal Freight Routing on A Network with Concave Costs,” Transportation Research Part B, Vol. 21, No. 1, pp. 37-45[19] Hall, R. W., 1989, “Configuration of An Overnight Package Air Network,” Transportation Research Part A, Vol.23, No. 2, pp.139-149[20] Hinojosa, Y., Puerto, J., Fernández, F.R., 2000, “A Multiperiod Two-Echelon Multicommodity Capacitated Plant Location Problem,” European Journal of Operational Research, 123, pp.271-291[21] Holland, J. H., Adaption in Natural and Artificial Systems, Univerity of Michigan Pres, Ann Arbor, 1975[22] Kuby, M. J. and Gray, R. G., 1993, “The Hub Network Design Problem with Stopovers and Feeders: The Case of Federal Express,” Transportation Research Part A, Vol. 27, No. 1, pp.1-12[23] Kaj Holmberg, Mikael Ronnqvist, Di Yuan, 1999, “An Exact Algorithm for The Capacitated Facility Location Problems with Single Sourcing,” European Journal of Operational Research, 113, pp.544-559[24] Klincewicz, J.G., 1990, “Solving A Freight Transport Problem Using Facility Location Techniques,” Operations Research, Vol. 38, No. 1, pp99-109[25] Klincewicz, J.G., 1991, “Heuristics for the p-Hub Location Problem,” European Journal of Operational Research, 53, pp.25-37[26] Köksalan, M., Süral, H., Kirca, ö., 1995, “A Location-Distribution Application for A Beer Company,” European Journal of Operational Research, 80, pp.16-24[27] Madsen, Oli B. G. 1983, “Methods for Solving Combined Two Level Location-Routing Problems of Realistic Dimensions,” European Journal of Operational Research, 12, pp.295-301[28] Melachrinoudis, Emanuel, Min, Hokey, 2000, “The Dynamic Relocation and Phase-Out of A Hybrid, Two-Echelon Plant/Warehousing Facility: A Multiple Objective Approach,” European Journal of Operational Research, 123, pp.1-15[29] Min, Hokey, Jayaraman, Vaidyanathan, Srivastava, Rajesh, 1998, “Combined Location-Routing Problems: A Synthesis and Future Research Directions,” European Journal of Operation Research, 108, pp.1-15[30] Nero, Giovanni, 1999, “A Note on The Competitive Advantage of Large Hub-and-Spoke Networks,” Transportation Research Part E, 35, pp.225-239[31] O’Kelly, M. E., 1986, “Location of Interacting Hub Facilities,” Transportation Science, Vol. 20, No. 2, pp.92-106[32] O’Kelly, M. E., 1992, “Hub Facility Location with Fixed Costs,” The Journal of the Regional Science Association International, 71(3), pp.293-306[33] O’Kelly, M. E., 1987, “A Quadratic Integer Program for The Location of Interacting Hub Facilities,” European Journal of Operation Research, 32, pp.393-404”[34] O’Kelly, M. E., Bryan, D., Skorin-Kapov, D., Skorin-Kapov, J., 1996, “Hub Network Design With Single and Multiple Allocation: A Computational Study,” Location Science, Vol. 4, No. 3, pp.125-138[35] Perl, J. and Daskin, M. S., 1985, “A Warehouse Location-Routing Problem,” Transportation Research Part B, Vol 19, No. 5, pp.381-396 [36] Pirkul, Hasan and Jayaraman, Vaidyanathan, 2001, “A Multi-Commodity, Multi-Plant, Capacitated Facility Location Problem:Formulation and Efficient Heuristic Solution,” Computers and Operations Research, Vol25, No. 10, pp.869-878[37] Powell, Warren B. and Sheffi, Yosef, 1989, “Design and Implementation of an Interactive Optimization System for Network Design in The Motor Carrier Industry,” Operations Research, 37(1), pp12-29[38] Skorin-Kapov D., Skorin-Kapov, j., 1994,”On Tabu Search for The Location of Interacting Hub Facilities,” European Journal of Operational Research, 73, pp.502-509[39] Skorin-Kapov, D., Skorin-Kapov, j., O’Kelly, M.E., 1996, “Tight Linear Programming Relaxations of Uncapacitated p-Hub Median Problems,” European Journal of Operations Research, 34, pp.582-193[40] Srivastava, Rajesh and Benton, W. C., 1990, “The Location-Routing Problem: Considerations in Physical Distribution System Design,” Computers and Operations Research, Vol.17, No.5, pp.427-435[41] Srivastava, Rajesh, 1993, “Alternate Solution Procedures for The Loacation-Routing Problem,” Omega International Journal of Management Science, Vol.21, No.4, pp.497-506[42] Sridharan, Rajesh. 1995, “The Capacitated Plant Location Problem,” European Journal of Operational Research, 87, pp.203-213[43] Tuzun, D., Burke, L.I, 1999, “A Two-Phase Tabu Search Approach to The Location Routing Problem,” European Journal of Operational Research, 116, pp87-99 [44] Warsing, D. P., Souza, G. C., Greis, N. P., 2001, “Determining the Value of Dedicated Multimodal Cargo Facilities in a Multi-region Distribution Network,” European Journal of Operational Research, 133, pp.81-93
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊