Hierarchical optimal routing algorithm based on genetic algorithm

Genetic algorithm can solve many problems of optimization.But if it is introduced to the problem of path planning directly,the algorithm will convergent slowly and encode hardly.A hierarchical algorithm based on genetic algorithm is proposed to reduce sea-rching space of genetic algorithm,and makes the result of choosing more reasonable.In the algorithm,roads of net are processed by the hierarchical scenario and hierarchical searched.Finally,validity of the algorithm is proved by experiment.