Vehicle Distribution Routing Optimization Model for Time-Varying Road Network Based on Adaptive Largescale Neighborhood Search Algorithm

摘要

According to the characteristics of short-distance instant distribution, the freshness measurement function of fresh products is designed according to the actual situation. Combined with the characteristics of vehicle speed changing with time under urban traffic conditions, a method of calculating and evaluating vehicle travel time is designed. Considering the minimum freshness limit of fresh products, the limitation of delivery time window and the multiple constraints of vehicle load, the calculation method of vehicle travel time is designed by us. In this paper, a multi-objective optimization model of instant distribution path for fresh products is constructed, which takes the minimum cost of vehicle distribution distance, the minimum of vehicle fixed cost and the minimum of freshness loss cost with the time-varying road network. According to the characteristics of the model, an adaptive large-scale neighborhood search algorithm is designed. The algorithm is capable of effectively solving the problem of vehicle routing planning under the dynamic changes of traffic information, customer requirements for freshness and delivery time, reasonably plan the distribution path and achieve the minimum total cost of distribution scheme. An example is designed to simulate the model and algorithm. The experimental results show that the model and algorithm are feasible and effective.