(3.226.72.118) 您好!臺灣時間:2021/05/13 06:56
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:張凱惠
研究生(外文):Kai-Huei Chang
論文名稱:整合多場站收送貨車輛途程問題與委託貨運公司
論文名稱(外文):A Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Outsider Carrier Selection
指導教授:張建仁張建仁引用關係朱經武朱經武引用關係
指導教授(外文):Jiang-Ren ChangChing-Wu Chu
學位類別:碩士
校院名稱:國立臺灣海洋大學
系所名稱:系統工程暨造船學系
學門:工程學門
學類:機械工程學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:中文
論文頁數:57
中文關鍵詞:多場站委外選擇啟發式演算法0-1整數規劃運籌車輛途程
外文關鍵詞:Multi-depot vehicle routing problem with pickup and deliveryCarrier selectionHeuristic0-1 integer programmingLogistics
相關次數:
  • 被引用被引用:3
  • 點閱點閱:255
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
由配送中心運送貨物服務顧客是配銷管理者每日所面臨的決策問題,如何有效率將貨物運送給顧客對配銷管理而言,是一項很重要的決策,本研究中以多個配送中心為研究對象,並以實務中多場站多車種同時收送貨車輛途程問題(Multi-depot Vehicle Routing Problem with Pickup and Delivery, MDVRPPD)為探討情境,當每天需求已知,配銷管理者需要面對多場站車輛途程同時收送貨問題的決策。現實情況中,一整年的需求波動不固定,當總需求量超過所有場站的載貨量時,管理者為公司節省成本追求最大效益,可能得考慮利用委託外包策略運送。
由於車輛途程問題的計算複雜度屬於NP-Hard的問題,若以數學規劃求解,不可能在合理時間內獲得結果,因此在可接受時間內,求得ㄧ高精準度的演算法協助配銷管理者解決上述問題有其必要性。
本研究之主要目的為在於滿足顧客需求及考慮公司成本下,發展一套啟發式演算法,幫助配銷管理者解決規劃運送路線問題。研究中建構數學規劃模式與發展啟發式演算法,其中數學規劃模式僅適合小型問題求解與驗證演算法精確度之用。經測試比較後顯示啟發式演算法之效率與準確度均十分良好。
謝誌 i
摘要 ii
Abstract iii
目錄 iv
圖目錄 vi
表目錄 vii
第一章 緒論 1
1.1研究動機與目的 1
1.3研究流程與內容 5
第二章 文獻回顧 7
2.1車輛途程問題的基本概念 7
2.1.1車輛途程問題的基本假設 10
2.2各類型車輛途程問題 11
2.3多場站車輛途程問題(MDVRP) 13
2.3.1 MDVRP之定義 13
2.3.2 MDVRP之求解方法回顧 14
2.4針對考慮同時收貨與送貨之車輛途程問題加以探討 15
2.5選擇以自有車輛或委託貨運公司服務 22
第三章 整數規劃模式與啟發式演算法 25
3.1整數規劃模式 25
3.2啟發式演算法 28
3.2.1選擇程序 29
3.2.2分群程序 30
3.2.3建構路徑 31
3.2.3.1建構起初解程序 32
3.2.3.2最佳化程序 35
第四章 範例說明與分析 39
第五章 結論與建議 48
5.1結論 48
5.2建議 49
參考文獻 50
附錄A 53
附錄B 55
[1] Ball, M.O., Golden, A., Assad, A., and Bodin, L.D., “Planning for truck fleet size in the presence of a common-carrier option”, Decision Sciences, Vol. 14, pp. 103-120, 1983.
[2] Casco, D.O., Golden, B.L., and Wasil, E.A., “Vehicle routing with backhauls: models, algorithms, and case studies”, In: Golden, B.L., and Assad, A. (Eds.), Vehicle Routing, Methods and Studies, Elsevier, Amsterdam, pp. 127–147, 1988.
[3] Lenstra, J.K., and Rinnooy, K., “Complexity of vehicle routing and scheduling problems”, Networks, Vol. 11, pp. 221-227, 1981.
[4] Bodin, L.B., Assad, A., and Ball, M., “Routing and scheduling of vehicle and crews: the state of the art”, Computers & Operations Research, Vol. 10, pp. 62-212, 1983.
[5] Wren, A., and Holiday, A., “Computer scheduling of vehicles from one or more depots to a number of delivery points”, Operational Research Quarterly, Vol. 23, pp. 333-344, 1972.
[6] Tillman, F.A., and Cain, T.M., “An upper bound algorithm for the single and multiple terminal delivery problem”, Management Science, Vol. 18, pp. 664-682, 1972.
[7] Cassidy, P., and Bennett, H., “TRAMP - a multi depot vehicle dispatching problem”, Operational Research Quarterly, Vol. 23, pp. 151-163, 1972.
[8] Golden, B.L., Magnanti, T.L., and Nguyen, H.Q., “Implementing vehicle routing algorithms”, Network , Vol. 7, pp. 113-148, 1997.
[9] Raft, O.M., “A modular algorithm for an extended scheduling problem”, European Journal of Operational Research, Vol. 11, pp. 67-76, 1982.
[10] Perl, J., and Daskin, M.S., “A warehouse location- routing problem”, Transportation Research, Vol. 19B, pp. 381-396, 1985.
[11] Benton, W.C., “Evaluating a modified heuristic for the multiple vehicle scheduling problem”, Institute of Industrial Engineers, Vol. 18, pp. 70-78, 1986.
[12] Laporte, G., Nobert, Y., and Taillefer, S., “Solving a family of multi-depot vehicle routing and location-routing problems”, Transportation Science, Vol. 22, pp. 161-172, 1988.
[13] Chao, I.M., Golden, B.L., and Wasil, E., “A new heuristic for the multi-depot vehicle routing problem that improves upon best-know solutions”, American Journal of Mathematical and Management Sciences, Vol. 13, pp. 371-401, 1993.
[14] Renaud, J., Laporte, G., and Boctor, F.F., “A tabu search heuristic for the multi-depot vehicle routing problem”, Computers and Operations Research, Vol. 23, pp. 229-235, 1996.
[15] Salhi, S., and Sari, M., “A multi-level composite heuristic for the multi-depot vehicle fleet mix problem”, European Journal of Operational Research, Vol. 103, pp. 95-112, 1997.
[16] Thangian, S.R., and Salhi, S., “Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem”, Applied Artificial Intelligence, Vol. 15, pp. 361-383, 2001.
[17] Nagy, G., and Salhi, S., “Heuristic algorithms for single and multiple and depot vehicle routing problems with pickups and deliveries”, European Journal of Operational Research, Vol. 162, pp. 126-141, 2005.
[18] Psaraftis, H.N., “A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem”, Transportation Science, Vol. 14, pp. 130-154, 1980.
[19] Min, H., “The multiple vehicle routing problem with simultaneous delivery and pick-up points”, Transportation Research, Vol. 23, pp. 377-386, 1989.

[20] Christofides, N., Mingozzi, A., and Toth, P., “The vehicle routing problem”, In: Christofides, N., Mingozzi, A., Toth, P., and Sandi, C., (Eds.), Combinatorial Optimization. Wiley, Chichester, UK, pp. 315-338, 1979.
[21] Golden, B.L., Baker, E.K., Alfaro, J.L., and Schaffer, J.R., “The vehicle routing problem with backhauling: two approaches”, Working paper MS/S 85-017, University of Maryland, College Park, 1985.
[22] Salhi, S., and Nagy, G., “A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling”, Journal of the Operational Research Society, Vol. 50, pp. 1034–1042, 1990.
[23] Schruben, L., and Clifton, R., “The lockset method of sequential programming applied to routing delivery and pickup trucks”, American Journal of Agricultural Economics, Vol. 50, pp. 854-867, 1968.
[24] Agarwal, Y.K., “Vehicle routing with limited fleet and common carrier option”, TIMS/ORSA Joint National Meeting, Boston, 1985.
[25] Klincewicz, J.G., Luss, H., and Pilcher, M.G., “Fleet size planning when outside carrier service are available”, Transportation Science , Vol. 24, pp. 169-182, 1990.
[26] Chu, C.W., “A heuristic algorithm for the truckload and less-than-truckload problem”, European Journal of Operational Research, Vol. 165, pp. 657–667, 2005.
[27] Clarke, G., and Wright, J.W., “Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research, Vol. 12, pp. 568-581, 1964.
[28] 劉曄,「整合同時收送貨與選擇貨運公司服務之車輛途程問題」,國立台灣海洋大學碩士論文,(2005)。
[29] 周偉禮,「以啟發式演算法求解單一場站多車種同時收送貨之車輛途程問題」,國立台灣海洋大學碩士論文,(2006)。
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊
 
系統版面圖檔 系統版面圖檔