An integrated framework for dynamic vehicle routing problems with pick-up and delivery time windows and shared fleet capacity planning

Official URL: https://dx.doi.org/10.3390/sym16040505

This paper proposes a novel route optimization framework to solve the problem of instant pick-up and delivery for e-grocery orders. The proposed framework extends the traditional time-windowed package delivery problem. We demonstrate the effectiveness of our approach for this integrated problem using actual delivery data from HepsiJet, a leading e-commerce logistics provider in Turkey. We first employ several machine learning algorithms and simulations to investigate the capacity of the courier. Subsequently, a dynamic route planning workflow is executed with a highly specialized and novel routing algorithm. Our proposed heuristic approach considers combined fleet operations for delivering regular packages originating from a central depot and dynamic e-grocery orders picked up at local supermarkets and delivered to the customers. The heuristic algorithm constitutes k-opt and node transfer operation variations customized for this integrated problem. We report the performance of our approach in problem instances from the literature and instances from HepsiJet’s daily operations, which we also publicly share as new route optimization problem instances. Our results suggest that, despite the more complex nature of the integrated problem, our proposed algorithm and solution framework produce more efficient and cost-effective solutions that offer additional business opportunities for companies such as HepsiJet. The computational analyses reveal that implementing our proposed approach yields significant efficiency gains and cost reductions for the company, with a distance reduction of over 30%, underscoring our approach’s effectiveness in achieving substantial cost savings and enhanced efficiency through integrating two distinct delivery operations.