Abstract
This paper presents a mathematical model for a single depot, time-dependent vehicle routing problem with backhaul considering the first in first out (FIFO) assumption. As the nature of the problem is NP-hard, variable neighborhood search (VNS) meta-heuristic and mat-heuristic algorithms have been designed. For test problems with large scales, obtained results highlight the superior performance of the mat-heuristic algorithm compared with that of the other algorithm. Finally a case study at the post office of Khomeini-Shahr town, Iran, was considered. Study results show a reduction of roughly 19% (almost 45 min) in the travel time of the vehicle.
Highlights
The vehicle routing problem (VRP) is amongst the important problems in operational research and physical distribution
This paper presents a mathematical model for a single depot, time-dependent vehicle routing problem with backhaul considering the first in first out (FIFO) assumption
Traffic and traversing a specific route by vehicles with different speeds during a day is an undeniable fact in the real work, considering which can make the model more realistic. This feature has led to the emergence of the time-dependent VRP (TDVRP) in the literature. Considering this feature, the present paper models the TDVRP with backhaul (TDVRPB)
Summary
The vehicle routing problem (VRP) is amongst the important problems in operational research and physical distribution. According to the definition of the VRP with Backhaul (VRPB) provided by (Toth & Vigo, 1997), set V, including all network nodes, is split into three subsets: L = 1, ... Traffic and traversing a specific route by vehicles with different speeds during a day is an undeniable fact in the real work, considering which can make the model more realistic. This feature has led to the emergence of the time-dependent VRP (TDVRP) in the literature. Considering this feature, the present paper models the TDVRP with backhaul (TDVRPB).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have