Research On The Method Of Routing Analysis Of Urban In Time-varying Networks

As urban traffic congestion has become increasingly "normalization",the travel time of road is no longer static but changing with time in urban traffic network.The result of path analysis based on static network is more and more inconsistent with the actual situation.Therefore,it is of great significance and value to study the path analysis method suitable for urban time-varying network environment.In this paper,based on the analysis of time-varying network and urban time-varying network path analysis,the urban time-varying network model is constructed,and the path analysis experiment system is developed with the ArcGIS Enging component in the Visual Studio 2010 development environment,and the path analysis under the urban time-varying network is implemented and verified by example.The main contents and results are as follows:(1)The time-varying network and urban rode time-varying network is discussed and analyzed from definition,description and time-varying characteristic,the time variant characteristics of urban road network are also studied.(2)Further analysis of urban time-varying network path is carried out.Based on the application of the shortest path optimality principle under the traditional network to the FIFO network,the traditional shortest path algorithm is analyzed and summed up.Combined with the characteristics of the urban road network path analysis,the Dijkstra algorithm is more suitable for solving the shortest path analysis problem of urban traffic network compared to the Bellman-Ford algorithm and the Floyd algorithm.The urban time-varying network path analysis is based on the path time consumption.The path analysis must take into account the delay of the steering.On the basis of the comparison and analysis of the node labeling algorithm and the arc marking algorithm,the arc marking algorithm is used to solve the shortest path problem considering the steering delay.To solve the three cases of fixed departure time,given departure time and given arrival time,we analyze and solve the problem of urban road time-varying network path analysis.In order to further improve the accuracy of the algorithm,the efficiency of the algorithm is improved from the two sides of the algorithm data structure and the search direction.The data structure uses the four forked priority queue and the heuristic search is used in the search direction.By using the edge elimination algorithm in the shortest path algorithm of K,the multiple alternative optimization paths between the starting point and the end point are solved to satisfy the user's choice of different travel routes to the maximum extent.(3)Research on the construction of urban time-varying network model.A lane level network is constructed by integrating all lanes on the same road and interworking at any time;In order to express the steering relationship between the driveways better,the dual network with the dual node of the lane is constructed,and the road network is used to visualize the road network with the advantages of the two lanes,and the path analysis is carried out by the dual network with the dual node of the lane;Based on the analysis of the time-varying characteristics of road sections and intersections,a calculation model of the passage time at any moment or at any intersection is given;Using Baidu map Web services in API bulk computing services(also known as Route Matrix API),achieves the speed of each section in each period.(4)Under the environment of Windows,based on the development platform of Visual Studio 2010,using component GIS technology,data acquisition and processing with ArcGIS Engine component,Baidu map API and Echart component,and the development of visual display and common function of GIS,an experimental system of urban time-varying network path analysis is built.the experimental system realiszes the functions of road topology network generation,road speed distribution acquisition,road speed distribution display and path analysis,and through the example,the three kinds of path analysis problems and the shortest path of K under the urban road time-varying network are tested and analyzed.