Research On Dynamic Route Guidance System Based On Improved Genetic Algorithm

As China's economic development, the city's size is gradually expanding the number of motor vehicles has also increased rapidly. Behind this prosperity, there is a variety of issues. Traffic congestion, exhaust pollution is a serious impact on the daily lives of urban residents. Each year the economic loss caused by traffic problems is incalculable. So, how can we improve the efficiency of urban road network, reduce vehicle travel time on the road, reduce the impact of traffic congestion has become an urgent need to solve our current problems.Dynamic route guidance system is the solution to the traffic congestion. And it is one of the best ways. Dynamic route guidance systems can lead to traffic in the most optimal path, reducing the passage of time, thus enhancing the utilization of the road to ease road congestion. The shortest path algorithm which is the core algorithm of dynamic route guidance system is a classic problem in graph theory, and it has always been a computer algorithm in the field of research focus.Genetic algorithm is one of the best search algorithms. And it has a great advantage in solving the shortest path issues based on the urban road network. Based on actual city road network access conditions, as undermine the algorithm to reduce the detrimental genetic algorithm initial population size, it has a great achievement to enhance the overall efficiency of genetic algorithm purposes. The same time, simulated annealing algorithm is introduced into the genetic algorithm to solve the shortcomings of premature convergence of genetic algorithms. But also considering the travel habits, through the fitness function for the changes, you can make the algorithm more humane, more in line with ergonomic. After the Search of Chang chun City traffic map, the algorithm described in the text viable, it has a higher efficiency and more accurate optimal solution as general genetic algorithm and detrimental to the search algorithm has.