臺灣博碩士論文加值系統

第三方物流業(Third Party Logistics Service Provider, 3PL)為台灣科學園區(Science Park)廠商創造新的競爭優勢，科學園區不僅是台灣的科技重鎮，也是全球供應鏈( supply chain manag- ement, SCM)之中最重要的環節之一，面對外在環境的激烈競爭，將關務作業與貨物運輸作業外包給3PL已經是維持競爭力必須的選擇，又近幾年來，受到國際原油價格高漲，使得3PL的營運成本不斷提高， 如何有效降低營運成本以維持本身競爭優勢已成為迫切且重要的課題，實有必要針對此一課題進行討論。本研究針對科學園區第三方物流業整車運輸(Full-Truck- Load)之車輛路線問題(Vehicle Routing Problem)進行探討，根據廠商的需求做取貨(pickup)或送貨(delivery)服務，就高科技產品而言，其具有高價值、易破損等特性，故廠商會要求物流業者使用氣墊(air-bags)車載運易破裂或高精密之產品、或使用溫控(temperature- control)車載運需溫度控制之物品、或使用一般貨車載運一般貨物等，此外，上下游廠商間之專業分工及採用低存貨策略，即物流業所屬之車輛自某廠商處收貨並送至其他廠商處、或為配合運具之出發時間與廠商之生產排程，故多會限制貨物送達目的地之時間。本研究則依問題特性直接建構數學模式，並自行設計例題進行模式驗證與求解分析，我們的目的是要針對車輛路線作規劃，並提供後續研究與業者營運之參考。

This paper has developed a model and designed some test problems for verify the model of Third Party Logistics Service Provider (3PL) at Science Park. The computational results indicated that the model could effectively solve test problems. We aim at the research to decrease the routing cost of transportation management in 3PL. 3PL pickup and deliver the high valued equipments or products for full-truck-load between different science park and pork. Moving high valued high valued equipments or products need very careful so 3PL use the vehicles that possess air-bags and temperature-control to deliver their products. In addition, the 3PL may know or unknown the orders of companies in advance. Therefore, the characters of the full- truck-load of 3PL include multi type vehicles, time constraint, pickup and delivery vehicles routing problem. We hope it is helpful to the reality management operation, and we are so interesting in the further discussion in this topic.

第一章 緒論.......................................................1
1-1 研究動機...................................................1
1-2 研究目的............... .............................3
1-3 問題說明...................................................3
1-4 研究範圍與限制..............................................5
1-5 研究方法...................................................6
1-6 研究步驟與流程..............................................7

第二章 文獻回顧...................................................10
2-1 科學園區物流業與一般物流業之相關研究.. ..........................10
2-2 貨物配送問題之相關研.....................................11
2-3 車輛路線問題之相關研究.........................................14
2-3-1 一般車輛路線問題..........................................14
2-3-2 具時窗限制車輛路線問題.....................................15
2-3-3 多車種車輛路線問題.........................................16
2-3-4 車隊規模問題........................................17
2-5 小結....................................................18
第三章 數學模式...................................................19
3-1 模式之建構構想...........................................19
3-2 數學模式................................................22
3-3 模式驗證.....................................................24
3-3-1 簡例說明..................................................24
3-3-2 求解結果..................................................33
3-4 臨時任務之處理方式........................................35
3-5 小結....................................................38
第四章 求解分析... .......................................40
4-1 問題設計與求解結果.........................................40
4-2 結果分析..................................................48
第五章 結論與建議..................................................49
5-1 結論......................................................49
5-2 建議......................................................49
參考文獻............................................................50
附錄A求解結果示意圖..................................................54

1.林志鴻，「汽車運送業拖車路線規劃問題之研究」，國立成功大學交通管理科學研究所博士論文，民國90年。
2.張有恆，現代物流管理，第一版，民國93年。
3.林志鴻，實體配送課程講義，南台科技大學行銷與流通管理研究所，民國94年。
4.蘇雄義，物流與運籌管理，初版，民國89年。
5.顏憶茹、張淳智，物流管理，第三版五刷，民國93年。
6.林志鴻，「宅配業車輛路線規劃問題之模式建立與求解」，運輸學刊，第十七巻第一期，頁65-94，民國94年。
7.林志鴻、許智為，「服務科學園區之物流業車輛路線問題之探討－以整車運輸為例」，中華民國運輸學會，第二十屆論文研討會。
8.簡世釗，「時窗與容量限制下車輛途程問題之研究」，成功大學工業管理所碩士論文，民國89年。
9.莊英群，「應用禁忌搜尋法於混合送收貨之車輛途程問題」，逄甲大學工業工程學所碩士論文，民國91年。
10. F.A.T. Montane and R.D. Galvao, “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service”, Computer & Operations Research 33 (2006) 595-619.
11. M. Desrochers and T.W. Verhoog, “ A NEW HEURISTIC FOR THE FLEET SIZE AND MIX VEHICLE ROUTING PROBLEM”, Computers Ops Res. （1991）Vol.18 ,No.3, pp.263-274.
12. B. Golden, A. Assad, L. Levy and F. Gheysens, The fleet size and mix vehicle routing problem. Computers & Operations Research Vol.11. No.1. pp. 49-66. 1984.
13. M. Gendreau, G. Laporte, C. Musaraganyi and E.D. Taillard, A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research 26(1999)1153-1173.
14. S. Salhi, M. Sari, D. Saidi and N. Touati, Adaptation of Some Vehicle Fleet Mix
Heuristics. Omega 1992；20：653-660.
15. F. Gheysens, B. Golden and A. Assad, A new heuristic for determining fleet size and composition. Mathematical Programming Study 1986;26:233-6.
16. L. Bodin and B. Golden, Classification in Vehicle Routing and Scheduling.Networks 11 (1981)97-108.
17. S. Salhi and G.K. Rand, Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research 66 (1993) 313-330.
18. M.M. Solomon and J. Desrosiers, Time Window Constrained Routing and Scheduling Problems. Transportation Science (1988) Vol.22,No.1,
19. H.C. Lau, M. Sim and K.M. Teo, Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research 148(2003) 559-569.
20 .M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40 (1992) 340-354.
21. J.F. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 37(2003) 579-594.
22. A. Kolen, A.H.G. Rinnooy Kan and H. Trienekens, Vehicle routing with time windows. Operations Research 35(1987) 266-273.
23. J.Y. Potvin, T. Kervahut, B.L. Garcia and J.M. Rousseau, The vehicle routing
problem with time windows Part Ι：Tabu Search. INFORMS Journal on Computing 8(1996) 158-164.
24. E.Taillard, P.Badeau, M.Gendreau, F.Guertin and J.Y.Potvin, A tabu search
heuristic for the vehicle routing problem with soft time windows. Transportation
Science 31(1997) 170-186.
25. S. Hertz and M. Alfredsson, Strategic development of third party logistics providers. Industrial Marketing Management 32(2003) 139-149.
26. S. Mitrovic-Minic, R. Krishnamurti and G. Laporte, Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research Part B 38(2004) 669-685.
27. S. Mitrovic-Minic and G. Laporte, Waiting strategies for the dynamic pickup and
delivery problem with time windows. Transportation Research Part B 38 (2004)
635-655.
28. J. Desrosiers, Y. Dumas, M.M. Solomon and D. Villeneuve, A Request Clustering
Algorithm for Door-to-Door Handicapped Transportation. Trnasportation Science
29(1995) 63-78.
29. M. Gronalt, R.F. Hartl and M. Reimann, “New savings based algorithms for time
constrained pickup and delivery of full truckloads.” European Jouranl of Opesearch 151(2003) 520-535.
30. Y. Dumas, J. Desrosiers and F. Soumis, The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22.
31. L. Bodin, B. Goloden, A. Assad and M. Ball, “Routing and Scheduling of Vehicle
and Crews：The State of The Art”, Computers and Operations Research 10 (1983) 63-211,.
32. Ching-Wu Chu.（2005）, “A heuristic algorithm for the truckload and
less-than-truckload problem”, European Journal of Operational Research 165
657-667.
33. J. Oppen and A. LØkketangen, Arc routing in a node routing environment. Computers & Operations Research 33 (2006) 1033-1055.
34. R. Kammarti, S. Hammadi, P. Borne and M. Ksouri, “A New Hybrid Evolutionary Approach For The Pickup And Delivery Problem With Time Windows”, International Conference on Systems, Man and Cybernetics, IEEE, (2004) 1498-1503.
35. T.R. Sexton and L.D. Bodin, “Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times：Ⅰ. Scheduling”, Transportation Science 19 (1985) 378-410.
36. G. Mosheiov, “The Travelling Salesman Problem with pick-up and delivery”, European Journal of Operational Research 79 (1994) 299-310.