Operational Implications of Time Window Relaxation in Vehicle Routing Problems

Saygili A. c., KAZAN H.

EKOIST-JOURNAL OF ECONOMETRICS AND STATISTICS, cilt.0, sa.41, ss.54-81, 2024 (ESCI, TRDizin)

Özet

The Vehicle Routing Problem with Time Windows (VRPTW) poses a significant challenge in logistics, requiring vehicles to meet the objective of minimising costs-such as distance travelled and total travel time-while adhering to specified delivery time constraints and vehicle capacities. This study investigates the implications of relaxing time window constraints by transitioning from VRPTW instances to standard Vehicle Routing Problem (VRP) instances. Our findings highlight notable differences between VRP and VRPTW configurations, particularly in total route length and consistency of route metrics. Removal of time window constraints generally resulted in shorter and more uniform route lengths, indicating operational benefits under certain conditions. However, our comparisons also revealed substantial variability in route structures across datasets, emphasising the cost implications of adhering to strict time windows. This study underscores the critical balance logistics firms must strike between operational efficiency and customer satisfaction when navigating the complexities of VRPTW. This research provides a foundation for future investigations into optimizing route planning under varying logistical constraints, with potential implications for enhanced flexibility and reduced operational costs despite dynamic delivery requirements. We used a state-of-the-art heuristic solver to solve instances from standard benchmark datasets heavily used for VRPTW literature.