Research on Optimization of Electric Vehicle Routing Problem With Time Window

As the urban population and scale gradually increase, the per capita income level of urban residents is also constantly increasing, more people have put forward higher requirements for material life. The degree of congestion of urban roads has a strong positive correlation with the development level of the national economy. The crowded lanes directly affect the way people travel, especially in the field of logistics distribution. Electric vehicle distribution is one of the existing distribution methods that is less affected by traffic, but it is subject to mileage, cargo capacity and number of vehicles. In order to find an optimal urban distribution route that satisfies both the electric vehicle limitation and the customer time window limitation, a mixed planning model is established to conduct in-depth research on the routing problem. In the process of verifying the correctness of the model, a mixed algorithm with lower time complexity, which was calculated by the highest order in the model, is established, and two sets of instance data are used for calculation. The results show that the mixed algorithm not only has a faster calculation speed, but also can calculate the vehicle route in a large-scale situation.