Research On Dynamic Route Optimization Of Urban Logistics Based On Space-time Scene

In recent years,with the development of the logistics,the pressure of city logistics distribution has rising sharply.Especially,the transport costs take up a large part of the logistics distribution.Path optimization is a great breakthrough in improving logistics distribution.In order to solve the problem of vehicle routing planning in actual situation,this paper puts forward a route optimization algorithm based on heuristic factor.The new algorithm introduced the concept of space-time path,which convert the Euclidean distance of the traditional way into space-time distance with time characteristics and space characteristics.And this paper provides a new research direction for vehicle routing problem with the method of dynamic path planning.This paper deals with three aspects.The first is the optimization of space-time distance measurement method.The second is designing an improved heuristic algorithm to solve shortest path planning problem.The third is simulating the shortest path planning method with dynamic calculation principle.In this paper,we regard the traveling salesman problem as a problem solving model,select the symmetric TSP problem data sets as the experiment data,and achieve the optimal algorithm in Matlab platform.Finally,we verify the effectiveness and superiority of the vehicle routing optimization scheme based on space-time path by comparison among of all kinds of solutions.The specific content of this paper include the following:1.As to the large area site vehicle distribution problem,we use K-means algorithm to cluster sites,and allocate vehicles as well as regional site reasonably.2.Improving existing space-time distance measurement method and separating space path and the actual path.Designing multivariate planning with historical data for space path in order to obtain reasonable space distance.Calculating instant road speed for time road to get time distance.At last,using the weight allocation method to measure the space-time distance.3.This paper design an optimal algorithm which introduce the genetic factor of genetic algorithm into the tabu search algorithm.And this algorithm expand the high-quality neighborhood of tabu search algorithm and improve the accuracy of target value and convergence speed.4.We use node calculation principle to plan dynamic path.This principle response the effect of vehicle speed change effectively and shorten the vehicle traveling time greatly.This research based on real demand has certain practical value.It puts forward a more practical solutions for urban distribution system,What's more,we designed a vehicle dynamic path optimization algorithm based on space-time path.This algorithm has verified its efficiency through numerical examples and provides a new research direction for vehicle path planning problem.