基于蚁群算法的多属性路径选择模型

Model of Choosing Routes with Multi-attributes Based on Ant Colony Algorithm

针对交通网络中多属性条件下的路径选择问题,本文基于蚁群算法讨论了给定起讫点对之间综合最优路径的实现步骤。首先将蚁群按照所给的属性集合分为若干个子蚁群,每个子蚁群给定不同的属性目标。然后在每一次循环的过程中,子蚁群按照既定的属性进行路径选择,在所有的子蚁群完成一次循环后,全局更新信息素。可知,各个子蚁群既按照自己的目标搜索最优解,同时各个子蚁群之间又互相影响,使得所得的结果不仅对于每个属性目标较优,而且综合效果也很好。最后进行了仿真实验并分析了结果。

For the route choice problem with multi-attributes in traffic networks, this paper, based on Ant Colony Algorithm （ACA）, obtains the model of getting synthesis optimal path for specified origin and destination. At first, the ant colony is divided into some sub-ant colonies, and different sub-ant colonise have different attributes. Then, each sub-ant colony makes a route choice according to its attribute in iteration. When all sub-ant colonies have finished iteration, we update the pheromone value. Each sub-ant colony not only searches optimal solution with its specified attribute, but also they influences each other. Therefore, the solution would be better for each attribute. In the end, a simulated test is executed.