Dynamic Traffic Management using Temperature Parameter Control in Q value-based Dynamic Programming with Boltzmann Distribution

In order to improve the efficiency of traffic systems in the global perspective, a traffic control strategy for the dynamic traffic management in the road network has been proposed in this paper. The main idea of the proposed traffic control strategy is based on Q value-based Dynamic Programming with Boltzmann Distribution, and the temperature parameters in Boltzmann Distribution are adjusted by the proposed temperature parameter control strategies, which are Network Method and Intersection Method, depending on the time-varying traffic situations. In the simulation, it is supposed that the route guidance is given to each vehicle and all the vehicles in the traffic system follow the guidance. The simulation results show that temperature parameter control in Q value-based Dynamic Programming with Boltzmann Distribution could improve the performance of the traffic system.

[1]  Klaus Bogenberger,et al.  Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System , 2007, IEEE Transactions on Intelligent Transportation Systems.

[2]  Shingo Mabu,et al.  Q Value-Based Dynamic Programming with Boltzmann Distribution for Global Optimal Traffic Routing Strategy , 2009 .

[3]  Don J. Torrieri Algorithms for finding an optimal set of short disjoint paths in a communication network , 1992, IEEE Trans. Commun..

[4]  Shingo Mabu,et al.  Dynamic optimal route search algorithm for car navigation systems with preferences by dynamic programming , 2011 .

[5]  André de Palma,et al.  Does providing information to drivers reduce traffic congestion , 1991 .

[6]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[7]  Piet Van Mieghem,et al.  Responsible Editor: A. Kshemkalyani , 2006 .

[8]  Shingo Mabu,et al.  Q Value-Based Dynamic Programming with Boltzmann Distribution in Large Scale Road Network , 2011 .

[9]  Osamu Katai,et al.  Multiagent model of VICS , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[10]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[11]  Na Lin,et al.  Improved Ant Colony Algorithm for Multipath Routing Algorithm Research , 2010, 2010 International Symposium on Intelligence Information Processing and Trusted Computing.

[12]  E. A. Guggenheim,et al.  Boltzmann's Distribution Law , 1956 .

[13]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[14]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[15]  Jeremy Woolley,et al.  Integration of the global positioning system and geographical information systems for traffic congestion studies , 2000 .

[16]  David E. Boyce,et al.  ROUTE GUIDANCE SYSTEMS FOR IMPROVING URBAN TRAVEL AND LOCATION CHOICES. IN: TRANSPORT AND INFORMATION SYSTEMS , 1988 .

[17]  Shingo Mabu,et al.  Optimal Route Based on Dynamic Programming for Road Networks , 2008, J. Adv. Comput. Intell. Intell. Informatics.

[18]  P. Bedi,et al.  Avoiding Traffic Jam Using Ant Colony Optimization - A Novel Approach , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

[19]  Barbara Kanninen,et al.  INTELLIGENT TRANSPORTATION SYSTEMS: AN ECONOMIC AND ENVIRONMENTAL POLICY ASSESSMENT , 1996 .