The Routing Optimization Based On The Ant Colony Microcanonical Annealing Algorithm Under The Large-scale Network

With the rapid economic development of China and the continuous improvement ofthe urbanization level，the transportation networks are more and more complex, trafficcongestion under large-scale road network become large hinder for the urbanization,traditional route guidance technology can not meet the traveller ’s quick trip needs.Dynamic traffic guidance systems is widely recognized as an important method to solvethe urban traffic congestion under the large-scale road network. This article relies on theNational Natural Science Foundation <central path optimization theory model andmethod under large-scale road network>, to study the dynamic traffic system under thelarge-scale road network, using the path optimization techniques to provide the mostexcellent path to ease urban congestion, and then improve the travel levels.This paper analyzes the problems of the Central dynamic traffic guidance system inthe the process of the practical application, noting that the purpose and significance ofthis study, and gives the research ideas, specific methods, guidancelogical framework andphysical framework for dynamic traffic of the system under the large-scale road network,and analysize the mine technologies theory.The theme of this paper is a hybrid algorithm based on bi-directional ant colonyalgorithm and microcanonical annealing algorithm, to solve the optimal path searchproblem under the large-scale road network.The paper first describes the current problem of path optimization selection underthe large-scale traffic network, Present the researching status of algorithm in and out ofChina; research several classic path optimization algorithms, including Dijkstra algorithmA*algorithm, Floyd algorithm, Simulated annealing algorithm, an so on.Through comparative analysis of the advantages and disadvantages of the the classicoptimal path algorithm, combine ant colony algorithm and microcanonical annealingalgorithm, design an efficient path optimization algorithm-bi-directional ant colonymicrocanonical annealing algorithm; and use the Mapinfo software to draw theChangchun Cityroad network, and use Matlab to code and design path search experiment, the experimental results show that the algorithm has a large advantage in the running timeand the global optimal solution.