Obtain the optimal of road network with annealing algorithm

Abstract

Simulated annealing algorithm is a heuristic algorithm, proposed one approximation algorithm kind of solving optimization combinatorial problems inspired by objects in the annealing process by heating crunch. The algorithm is superior to the traditional greedy algorithm, which avoiding falling into local optimum and reach global optimum. In road network planning, often encountered some kind of traffic problems, for the distribution of traffic, need to achieve optimal in planning. The article uses an example of simulating annealing algorithm validation to verify it, the effect proved to be feasible.