城市物流在使用電動車情境下配送途程計劃 方法之發展

A Planning Distribution Method for the City Logistics Using Electric Vehicle

張婕昕(Chieh-Hsi Chang)

指導教授 ： 呂俊德

國立中央大學/管理學院/企業管理學系/碩士(2015年)

摘要

中文摘要
空氣汙染、噪音汙染、石油危機一直是近幾年來人們擔心的議題，為了使環境更加友善，各國政府紛紛致力於投入環保事業，部分的物流業者也加入了這波環保浪潮，將車隊中的車種部分改成電動車種，以降低對環境的傷害。本篇研究中，以城市物流為主軸，與Erdoğan和Miller (2012) 所提出的綠色車輛途程問題 (GVRP) 為雛形，發展一套適用於城市內的小型電動車配送模式，並提出一套新的演算法來解決。在模擬電動車配送時，為考量到現實生活中充電站不足的問題，本研究將充電站設置於物流中心內，僅能在物流中心進行充電，所以車輛必須在時間內完成顧客節點的配送，另外也考量到每輛配送車的乘載量問題，所以在城市物流配送時，除了力求最短路徑以降低成本之外，也考量了時間限制與乘載量限制，亦允許先回到物流中心的車輛進行第二趟的配送，避免造成車輛閒置。最後，本論文以日本名古屋城市中的Family Mart進行實例模擬成果。

關鍵字

城市物流 ； 電動車 ； 乘載量限制 ； 時間限制 ； 最短路徑

並列摘要

ABSTRACT
In recent years, the air pollution, noise problem and oil crisis have been the important topics which people really concern. In order to make the environment friendly, governments and partial logistic industry have committed to strive in environment protection with changing some of their petroleum-based vehicles into electric-base vehicles. In this study, considering the Green Vehicle Routine Problem (GVRP) presented by Erdoğan and Miller (2012) as a prototype, with a new algorithm constructed we develop a method for electric vehicle distribution that tries to solve a shortest path problem in city logistic. In the reality, lack of charging station is a main problem for the electric vehicle usage. This study set the charging station in logistic center which confines that the vehicles can be charged only in logistic center while distributing. So the vehicle fleets must complete the distribution for their customer nodes within a time limit. In the distribution tours the vehicle loading also is a key parameter included in the simulation. So, this study in the planning of the city distribution process not only seeks for the shortest distribution path, but also considers the factors of the loading capacity and the time limit. This developed method allows every vehicle getting second distribution tour that could effectively minimize the vehicle idle time. Finally, the paper takes the Family Mart in Nagoya, Japan as a study case to demonstrate the result of the present algorithm.

並列關鍵字

City Logistic ； Electric Vehicle ； Loading Limit ； Time Limit ； Shortest Path

參考文獻

Amaya, A., Langevin, A. and Trepanier, M. (2007). The capacitated arc routing problem with __refill points. Operations Research Letters, 35 (1), 45-53.

Baldacci, R. and Maniezzo, V. (2005). Exact methods based on node-routing formulations for __undirected arc-routing problems. Networks, 47(1), 52-60.

Bapna, R., Thakur, L. and Nair, S. (2002). Infrastructure development for conversion to __environmentally friendly fuel. European Journal of Operational Research, 142(3), __480-496.

Bard, J., Huang, L., Dror, M. and Jaillet, P. (1998). A branch and cut algorithm for the VRP __with satellite facilities. IIE Transactions, 30(9), 821-834.

Belenguer, J. and Benavent, E. (2003). A cutting plane algorithm for the capacitated arc __routing problem. Computers & Operations Research, 30(5), 705-728.