Data‐Driven Robust Optimization for Solving the Heterogeneous Vehicle Routing Problem with Customer Demand Uncertainty

Abstract

In practice, the parameters of the vehicle routing problem are uncertain, which is called the uncertain vehicle routing problem (UVRP). Therefore, a data-driven robust optimization approach to solve the heterogeneous UVRP is studied. The uncertain parameters of customer demand are introduced, and the uncertain model is established. The uncertain model is transformed into a robust model with adjustable parameters. At the same time, we use a least-squares data-driven method combined with historical data samples to design a function of robust adjustable parameters related to the maximum demand, demand range, and given vehicle capacity to optimize the robust model. We improve the deep Q-learning-based reinforcement learning algorithm for the fleet size and mix vehicle routing problem to solve the robust model. Through test experiments, it is proved that the robust optimization model can effectively reduce the number of customers affected by the uncertainty, greatly improve customer satisfaction, and effectively reduce total cost and demonstrate that the improved algorithm also exhibits good performance.

Vehicle logistics intermodal route optimization based on Tabu search algorithm

“…The second level is subordinate to sales logistics, which is divided into engineering vehicle logistics, commercial vehicle logistics Passenger vehicle logistics and special vehicle logistics are shown in Fig. 1 14,15 .…”

Customer satisfaction assessment index system for commercial vehicles based on fuzzy comprehensive assessment

“…In the eyes of different users, the satisfaction of the same car is different. Even if the satisfaction with the car is the same, the feelings of service, attitude and after-sales maintenance in the car sales process are different, which leads to different overall satisfaction 9 . How to build a comprehensive, scientific and reasonable index system is an important factor to judge the final result of satisfaction.…”

Vehicle Routing Optimization System with Smart Geopositioning Updates

“…Therefore, the completeness of the graph is assumed, with the edge weights d (i, j) usually representing the conventional distances between particular pairs of destinations, known further as DistMx. Detailed descriptions of the model under consideration can be found in [36][37][38].…”