A global routing strategy in dynamic traffic environments with a combination of Q value-based dynamic programming and boltzmann distribution

A simple traffic system is proposed in this paper, in which the global optimal route considering the traffic volume is selected as the guidance for the vehicles. In the proposed system, Q value-based dynamic programming is adopted to calculate the optimal traveling time to each destination from every intersection of the road network. And Boltzmann optimal route method is used to generate several route candidates, the usefulness of which is evaluated in terms of the total traveling time considering traffic volume. Furthermore, dynamically changing traffic volumes of all the given origin-destination pairs of road networks are constantly provided in the road simulation we used and the traveling time of each section is continuously updated according to its dynamic traffic volume. In this paper, the analysis and comparison between greedy strategy and Bolztmann strategy with various ldquotemperaturesrdquo are carried out. The simulation result showed the effectiveness of the proposed Boltzmann optimal route method.