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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.