封閉型物流中心配送路線規劃－以I公司為例

The Vehicle Routing Problem for the Distribution Center Built by Retailer - A Case Study of I Logistics Company

10.6132/JCM.2015.8.1.16

李穎(Ying Lee)；王士瑋(Shi-Wei Wang)；楊勝傑(Sheng-Jie Yang)；林庭荻(Ting-Di Ling)；張至揚(Chi-Yang Chang)

車輛路徑問題 ； 配送 ； 物流中心 ； Vehicle Routing Problem ； Delivery ； Distribution Center

商業現代化學刊

8卷1期（2015 / 06 / 01）

310 - 314

繁體中文

隨著經濟發展及產業型態的變化，許多企業為降低物流成本而整合其自家的流通通路體系，自行設立物流中心以服務旗下各通路點，此稱之為封閉型物流中心。封閉型物流中心之配送路線規劃多採用人工經驗法則進行排程，如遇複雜度高的問題，難以在短時間規劃最佳路線。本研究以某量販業轉投資之I 物流中心為例，使用數學規劃方式以LINGO 軟體為求解工具，並以運輸成本最低為目標為其規劃配送高屏地區分店時之最佳路線。研究結果顯示，本研究求解得之最佳路徑較傳統經驗法則所規劃之路徑約可以節省8%~12%的路線成本。透過I 物流中心實際配送資料驗證的結果，顯示本研究提出的方式確實能降低運輸油耗成本，且具有實務應用之能力。

To reduce the logistics cost and promote services quality, many retailers build the Distribution Center (DC) to arrange the delivery. Most DCs rely on the staffs’ experience and take a long time to plan the daily delivery routes. This study applies Mathematical Programming approach and Lingo as the tool to search the optimal daily delivery routes for a DC of I Logistics Company in southern Taiwan. The objective function of the model aims at minimizing the sum of transportation cost which depends on vehicle routing distance. Comparing with delivery routes planed by staffs’ experience, the optimal routes searched by this study can save 8%~10% transportation cost. The results of computational experiments showed that the proposed approach outperform the existing approach and can fulfill the practical use.