A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows

Shangyao Yan, James C. Chu, Fei Yen Hsiao, Han Jheng Huang

研究成果: 雜誌貢獻期刊論文同行評審

26 引文 斯高帕斯(Scopus)

摘要

Abstract This study proposes a daily vehicle routing model for minimizing the total cost of replenishing inventory within a supply chain. The first major contribution of this research is to allow multiple use of vehicles in a split delivery vehicle routing problem with time windows (SDVRPTW), which is more realistic for various real-life applications. The multi-trip SDVRPTW (MTSDVRPTW) is formulated using the time-space network technique, which provides greater flexibility for formulating the complicated interactions between vehicles and products when multi-trip, split delivery, and delivery time windows are simultaneously considered. The resulting formulation of the MTSDVRPTW can be categorized as an integer multi-commodity network flow problem with side constraints. A two-step solution algorithm is proposed to solve this NP-hard problem, which is the second major contribution of this research. Finally, a real-world scale numerical example is performed to demonstrate and to test the methodology. The results indicate that these vehicle routing problems can be solved effectively and efficiently and that the proposed methodology has great potential for inventory replenishment scheduling where split deliveries and multiple trips for a single vehicle are allowed and time window constraints are imposed.

原文???core.languages.en_GB???
文章編號4068
頁(從 - 到)383-393
頁數11
期刊Computers and Industrial Engineering
87
DOIs
出版狀態已出版 - 13 6月 2015

指紋

深入研究「A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows」主題。共同形成了獨特的指紋。

引用此