遗传算法在路径规划上的应用

为了满足出行者能高效快捷地到达目的地, 需要找到一条综合权值最优的出行路径, 再在其上设置指路标志对目的地进行指引. 基于此, 本文首先根据路网的特点, 对交通路网模型进行表述; 接着阐述了遗传算法的基本概念和算法思想, 并以行驶路程和交叉口个数作为出行者路径选择的因素, 定义了行驶路程和交叉口个数综合指标最小的路径为最优路径; 最后, 以广州大学城中山大学为例, 在明确起终点的情况下, 利用遗传算法的方法找到了去往中山大学的最优路径, 验证了遗传算法在路径规划上的有效性.

Application of Genetic Algorithm in Path Planning

In order to reach the destination efficiently and quickly, it is necessary to find a travel path with the best comprehensive weight, and then set a guide sign on it to guide the destination. Based on this, this paper first describes the traffic network model according to the characteristics of the road network. Then, it expounds the basic concept and algorithm idea of genetic algorithm, and defines the path with the minimum comprehensive index of the driving distance and the number of intersections as the optimal path with the number of driving distance and intersections as the factors of route selection. Finally, it takes Sun Yat-Sen University in Guangzhou University City as an example under the condition that the starting and ending points are clear, the optimal path to Sun Yat-Sen University is found by using the method of genetic algorithm, which verifies the effectiveness of genetic algorithm in path planning.