基于蚁群算法的农村公共交通线路研究

Study on Rural Public Transportation Routes Based on Ant Colony Algorithm

根据农村客运交通需求,采用网图模拟农村情况,将人流量引入蚁群算法,分别赋予路径长度及客流以不同的权重,使得目标由原先的求最小路径变为求人流量尽可能大的最优路径;再对网图中路径进行蚂蚁算法求解,研究结果表明,在引入人流量参数后,最优路径发生改变,最优路径覆盖了更多人流量的村庄。

According to the demand of rural passenger transportation, the network map is used to simulate the rural situation, and the flow of people is introduced into the ant colony algorithm, and different weights are given to the length of the path and the flow of passengers, so that the goal is changed from the original minimum path to the optimal path with the maximum flow of people. After the ant algorithm is used to solve the path in the network graph, the results show that the optimal path changes after the introduction of the parameter of human flow, and the optimal path covers the villages with more human flow.