Skip to Main content Skip to Navigation
Conference papers

Dynamic Multiple Depots Vehicle Routing in the Physical Internet context

Abstract : This paper proposes Dynamic Multiple Depots Vehicle Routing (DMDVR) to explore the feasible solution of routing transportation between PI-hubs and retailers in the same cluster. The routing solution in this research is constructed by the daily forecasting demand of a commodity crop, Pineapple, from Thailand's northern region. Each route is composed of a starting hub, the number of retailers, and an ending hub. The authors propose Mixed Integer Linear Programming (MILP) to construct the routes considering inventory and truck capacity constraints. Besides, another solution method is proposed by using a heuristic method named “Iterated Random Heuristic”. The empirical results are evaluated by using the total distribution cost and computational time. The routing transportation of this research is based on the daily delivery transportation from PI-hubs to retailers. The results show that Iterated Random Heuristic with Nearest Neighbor Search generates near-optimal solutions within a short computational time.
Document type :
Conference papers
Complete list of metadata
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Friday, July 1, 2022 - 2:31:01 PM
Last modification on : Tuesday, July 12, 2022 - 3:47:18 AM


Publication funded by an institution


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License




Anirut Kantasa-Ard, Tarik Chargui, Abdelghani Bekrar, Abdessamad Ait El Cadi, Yves Sallez. Dynamic Multiple Depots Vehicle Routing in the Physical Internet context. 17th IFAC Symposium on Information Control Problems in Manufacturing INCOM 2021, Jun 2021, Budapest, Hungary. pp.92-97, ⟨10.1016/j.ifacol.2021.08.011⟩. ⟨hal-03711586⟩



Record views


Files downloads