Data‐Driven Robust Optimization of the Vehicle Routing Problem with Uncertain Customers

Abstract

With the increasing proportion of the logistics industry in the economy, the study of the vehicle routing problem has practical significance for economic development. Based on the vehicle routing problem (VRP), the customer presence probability data are introduced as an uncertain random parameter, and the VRP model of uncertain customers is established. By optimizing the robust uncertainty model, combined with a data‐driven kernel density estimation method, the distribution feature set of historical data samples can then be fitted, and finally, a distributed robust vehicle routing model for uncertain customers is established. The Q‐learning algorithm in reinforcement learning is introduced into the high‐level selection strategy using the hyper‐heuristic algorithm, and a hyper‐heuristic algorithm based on the Q‐learning algorithm is designed to solve the problem. Compared with the certain method, the distributed robust model can effectively reduce the total cost and the robust conservatism while ensuring customer satisfaction. The improved algorithm also has good performance.