同時收送貨車輛配送問題之研究

A Study for Vehicle Routing Problem with Simultaneously Delivery and Pickup with Time Windows

邱仕銘(Shi-Ming Chou)

指導教授 ： 黃泰林

共同指導教授 ： 林傑毓

長榮大學/管理學院/經營管理研究所(博)/碩士(2006年)

https://doi.org/10.6833/CJCU.2006.00008

摘要

就物流業者而言，派遣車輛運送至顧客需求點時，通常會有同時取貨與送貨的需求。因此，本研究的基本假設主要是建立在顧客需求點可能同時具有需要送貨及收貨的情況，並且在不違背車容量限制以及顧客開始服務的時刻必須在規定時間區間內的條件下，能夠讓配送車輛以最小的途程距離來服務完所有的需求點。另外，本研究也考量解除車輛途程問題中，需求點僅能被單一配送車輛服務一次之限制情況，俾利進行多趟次之車輛配送任務。
據此，本研究根據上述之情形建構一系列之數學規劃模式，並利用ILOG OPL Studio 3.6.1之套裝軟體來進行測試與求解。雖然目前關於具同時收送貨與多趟次車輛途程問題方面之研究在學術上鮮少被探討，但在實務應用方面，對於企業在物流方面如何能降低營運成本及增進其配送服務效率上，卻是目前企業急欲探究之重要課題。因此，本研究擬透過構建數學規劃模式與廣泛之實驗設計與案例設計來進行分析與探討，期能裨益於相關業者並對於車輛途程問題之未來研究提供參考之依據。

關鍵字

具同時收送貨之車輛途程問題 ； 多趟次車輛途程問題

並列摘要

In many practical conditions, the vehicle is often required to simultaneously drop off goods and pick up goods at the same customers.
Customers usually have the requirements of both deliveries and pickups.
The study supposes that customers have the requirements of both deliveries and pickups at the same time. This will be under the limitation of the capacity of the vehicle and the time of serving customers should be in the defined time window to make the vehicle finish the serving in the lowest cost.
In addition, the study also discusses the situation that vehicle can carry on the mission not only for one time but also several times in a time window.
Therefore, the study establishes a series of modes of mathematical scheme and use the set of ILOG OPL Studio 3.6.1 software to test and find the solutions. Although the studies of the two kinds of the vehicles are quite few discussed in academic, it is the very field for the enterprise groups eager to go into to reduce the operating cost in delivery and increase the efficiency of delivery. The study will offer the revising mode of mathematical scheme, the analysis of the solutions and the suggestion. We expect to resolve the vehicle routing problems and help
to apply in practical.

並列關鍵字

Vehicle Routing Problem with Simultaneously Delivery and Pickup with Time Windows ； Multi-trip Vehicle Routing Problem with Time Windows ； ILOG OPL Studio

參考文獻

1. 林惠民（民91），具時窗之多趟次車輛途程問題，元智大學資訊管理研究所碩士論文，未出版，桃園。

3. 吳泰熙（民92），含取貨之車輛途程問題解法之研究，Journal of the Chinese of Industrial Engineers, Vol.20, No.6, pp.651-665.

7. Bodin, L., and B. Golden（1981）, Classification in vehicle routing and scheduling, Networks, 11, pp.97-108.

10. Brandao, J. and Mercer, A.（1997）, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, European Journal of Operations Research, 100, pp.180-191.

12. Clarke, G., and Wright, J.（1964）, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12, pp.568-581.