遗传算法能很好的解决许多的优化问题,但如果将它们直接引入到路径规划中,则由于存在大量的道路结点,使得算法收敛速度慢且编码困难。为了减小遗传算法的搜索空间,同时使路径的选择更加合理,提出了基于遗传算法的分层算法。该算法利用道路网络中路径的等级特性,对路网进行分层,实现分级搜索,实验结果表明其有效性。
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 searching 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.