An XGBoost-enhanced fast constructive algorithm for food delivery route planning problem

Abstract As e-commerce booms, online food ordering and delivery has attracted much attention. For food delivery platforms, planning high-quality routes for drivers so as to accomplish the delivery tasks efficiently is of great importance. This paper addresses a food delivery route planning problem (FDRPP), which considers one driver delivering multiple orders from restaurants to customers. Due to the immediacy of the delivery tasks, very limited computational time is provided for generating satisfactory solutions. We mathematically formulate the FDRPP and propose an Extreme Gradient Boosting-enhanced (XGBoost-enhanced) fast constructive algorithm to solve the problem. To construct a complete route, an insertion-based heuristic with different sequencing rules is adopted, together with an acceleration strategy based on geographic information to speed up the insertion procedure. In order to avoid the waste of computational time, we design an adaptive selection mechanism to select sequencing rules for route construction. A classification model using XGBoost is established to predict the performance of different sequencing rules. Through analysis of the route construction procedure, three types of problem-specific features are designed to improve the performance of XGBoost. The effectiveness of the proposed algorithm is demonstrated by conducting experiments on datasets from Meituan food delivery platform, which shows that large amounts of computational time can be saved by our proposed algorithm, while guaranteeing the quality of solutions.

[1]  James J. Q. Yu,et al.  Online Vehicle Routing With Neural Combinatorial Optimization and Deep Reinforcement Learning , 2019, IEEE Transactions on Intelligent Transportation Systems.

[2]  Arthur V. Hill,et al.  An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .

[3]  Ali Ridha Mahjoub,et al.  Models for the single-vehicle preemptive pickup and delivery problem , 2010, Journal of Combinatorial Optimization.

[4]  K. G. Murty,et al.  An Algorithm for the Traveling Salesman Problem , 2019 .

[5]  Thashika D. Rupasinghe,et al.  Machine Learning-Based Parameter Tuned Genetic Algorithm for Energy Minimizing Vehicle Routing Problem , 2017 .

[6]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[7]  Abdullah Al Nahid,et al.  Effective Intrusion Detection System Using XGBoost , 2018, Inf..

[8]  Lei Wu,et al.  A new robust criterion for the vehicle routing problem with uncertain travel time , 2017, Comput. Ind. Eng..

[9]  Yazid Mati,et al.  A tabu search heuristic for the single vehicle pickup and delivery problem with time windows , 2001, J. Intell. Manuf..

[10]  Harilaos N. Psaraftis,et al.  A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases , 2011, Eur. J. Oper. Res..

[11]  Lawrence V. Snyder,et al.  Reinforcement Learning for Solving the Vehicle Routing Problem , 2018, NeurIPS.

[12]  Jan Karel Lenstra,et al.  Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..

[13]  Ali Movahedi,et al.  Toward safer highways, application of XGBoost and SHAP for real-time accident detection and feature analysis. , 2019, Accident; analysis and prevention.

[14]  Gilbert Laporte,et al.  Perturbation heuristics for the pickup and delivery traveling salesman problem , 2002, Comput. Oper. Res..

[15]  Gilbert Laporte,et al.  Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007, INFORMS J. Comput..

[16]  Jacques Renaud,et al.  A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..

[17]  F.C.J. Lokin Procedures for travelling salesman problems with additional constraints , 1979 .

[18]  Chao Mao,et al.  A reinforcement learning framework for the adaptive routing problem in stochastic time-dependent network , 2018 .

[19]  Lei Wu,et al.  Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty , 2020, Comput. Ind. Eng..

[20]  Juan José Salazar González,et al.  A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010, Networks.

[21]  Christine L. Mumford,et al.  The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms , 2010, J. Heuristics.