Research On Urban Logistics Distribution Based On Path Selection

In the past few decades,with the continuous advancement of China's urbanization process,traffic congestion in large cities has become more serious.As of 2016,China's urbanization rate is over 57%,the urban population is close to 750 million,and China's urbanization process is still rapid.The continuous urbanization construction has caused a large number of people to flow into the city,which has led to more and more megacities.The problem of urban congestion has attracted widespread attention from many scholars.Considering the multi-channel characteristics of the city can not only balance the traffic flow on the road network,but also greatly alleviate the traffic congestion problem in the city.This is also the problem of urban distribution based on multi-channel environment has become a hot spot in the transportation field this year.Firstly,the paper studies the problem of low-carbon vehicle path with time window based on path selection,and uses multidimensional matrix dimension reduction method to represent multi-path network in the data processing stage.At the same time,urban distribution under multi-channel environment is taken as the research object.A multi-path based mixed-time integer mathematical programming model with time window is established,and an improved tabu search algorithm is designed to solve the problem.In the algorithm design,a variety of neighbors are constructed.The domain structure ensures that the designed tabu search algorithm can jump out of the local optimal solution and finally obtain the global optimal solution.At the same time,the validity of the model and algorithm is verified by simulation numerical analysis.Secondly,based on the research of path-selective low-carbon vehicle routing with time window,dynamic urban routing with multi-path environment is taken as the research object,and dynamic vehicle routing problem with path flexibility is established.Problem With Path Flexibility(DVRP-PF)is a two-stage mixed integer mathematical programming model,and the problem is solved by improved genetic algorithm and tabu search algorithm.At the same time,the crossover and mutation operators are improved in the genetic algorithm,and the customer position is exchanged by the two-stage successive correction operator to improve the performance of the algorithm.Then thevalidity of the model and algorithm is verified by simulation numerical analysis.Finally,this paper takes the urban distribution of Chongqing department store as an example,and uses the relevant algorithms to solve the case.The results show that considering the multi-path road network environment can significantly reduce the distribution cost.On this basis,the paper also analyzes the information update node of the dynamic vehicle routing problem.The results show that there are advantages and disadvantages of time interval update,customer point update and key node update,but the key node information is updated in the distribution example of Chongbai Supermarket.The mechanism has achieved even better results.This fully demonstrates that by considering the multi-path road network environment and reasonable selection of information to update nodes,this can significantly reduce urban traffic congestion problems,and thus better reduce the distribution costs of logistics enterprises.