Study On Dynamic Path Optimization Method Based On Game Theory

These years, the importance of the urban road network as a lifeline of the urban development has increased with the rapid development of cities. Unimpeded and high effcient of the road network are one of the key factors to determine the success or not of a road network.Using the Intelligent Transportation System to solve the network problem is a trend. Dynamic Route Guidance System is a part of the ITS, and also is an important means of the urban traffic management.The method of dynamic path optimization is the core of dynamic route guidance.At present, they only use the BPR model to calculate the link’travel time in the studying of using game theory to study the network’optimization. This article grasp the contradictions between the best of the administrator with the best of the system, and starting from the point of contradiction,using the game theory establish the game model between the managers and travelers in the route guidance mode. For the above problem, this article combines Gather-disperse Theory in the model. The link’travel time is divided into the free segment travel time and queuing time. Managers no longer to purse the shorest travel time, but the least comprehensive travel cost, and travelers use utility theory to assess the effectiveness. Finally, put forward a heuristic algorithm for the game model.At last, a simulation on a typical traffic network are given. Through comparison of the results under two different condition, the conclusion is given that the dynamic route can improve the network performance and reduce the total cost of the network. And it is proved that the model in this article is practical and algorithm is feasible.