共同配送策略下運送路徑問題之研究

The Freight Routing Planning Problem with Consolidated Transportation Strategy

呂國良(Kuo-Liang Lu)

指導教授 ： 胡 黃 德

元智大學/工程學院/工業工程與管理學系/碩士(2002年)

摘要

近年來，由於國內經濟持續發展，貨物運輸之運量成長快速，因而貨物運輸業之市場呈現激烈競爭。國內零擔貨運業受地理環境與國外大不相同，大部分以沿途載運來增加車輛載運量，達到整車效果。所謂零擔貨運是指貨物量小於一輛車，車輛不用滿載運送即可派車之貨運。由於國內零擔貨運業其內部營運網路皆是固定路線、固定班次，故又稱為路線貨運業。共同配送是指將一些相近地理區域內經常性或運輸量之小貨物合併一起運送，降低運送成本，故又稱為合併運送。本研究在搜尋貨物轉運途程上主要以最小成本流量搜尋得之，在需求量已知條件下，相當於求解貨物之最短指派路徑問題。然而所提出之模式具有轉運站節點容量限制。求解方法以分解啟發式演算法求解，先求解最小成本流量問題之貨物路徑選擇問題，再加入時窗限制的問題，最後解車輛指派問題，而車輛指派問題可轉換為傳統交通指派問題。本研究以民國90年7月至12月國內某個案貨運公司每月所抽樣一天之路線資料作為測試並比較。結果顯示共同配送模式將可有效的降低運輸成本及指派車輛數，而在車輛承載率方面因為沿途載運空車調度作業較為頻繁，降低其車輛承載率，故共同配送模式下車輛之承載率比沿途載運模式高。

關鍵字

共同配送 ； 零擔貨運 ； 啟發式演算法

並列摘要

Recently, the fast growth of the freight transportation industry accompanying with the domestic economy development competes the market dramatically. However, the Less Than Truckload (LTL) freight transportation industry grows with the constraints of the domestic geographical impacts by using the consolidation of the truckloads. The domestic LTL freight transportation industry develops the business transportation network by the fixed route and schedule. The consolidated transportation strategy is to combine the small volume of the neighbor hood transportation into a large volume transportation so as to reduce the transportation cost.
The purpose of this research was to search for the least cost flow and route under the know demand constraints. The solution started with the least cost routing problem, then it considered the time window constraints, and finally the vehicle assignment problem was to be solved. The study utilized the test data offered by the local case study company with the sample of the average day load and routing from July to December in 2001. The results show that the consolidated strategy can reduce the transportation cost as well as the number of the trucks. The utilization of the truck also increases with the add-up of the loads of the local loads.

並列關鍵字

Conssolidated Transportation ； Less Than Truckload ； Heuristic Algorithm

參考文獻

敖君瑋，「禁制搜尋法於軟性時窗限制之車輛途程問題之研究」，元智大學工業工程研究所，碩士論文，1999。

林書銘，「禁制搜尋法於含時窗與裝載限制車輛途程問題解算之研究」，元智大學工業工程研究所，碩士論文，1999。

曾維豪，「軟性時窗與回程撿收之車輛途程問題研究」，元智大學工業工程研究所，碩士論文，2000。

Current, J. R., C. S. Revelle and J. L. Cohon, “The Hierarchical Network Design Problem,” Eur. J. Opnl. Res., 1986, Vol. 27, pp. 57-66.

Current, J. R., “The Design of Hierarchical Transportation Network with Transshipment Facilities,” Transportation Science, 1988, Vol. 22, No. 4, pp. 270-277.