公交出行路径蚂蚁算法  

Bus travel transit path based on ant algorithm

作　　者：李文勇[1] 王炜[1] 陈学武[1] 

机构地区：[1]东南大学江苏省交通规划与管理重点实验室

出　　处：《交通运输工程学报》2004年第4期102-105,共4页Journal of Traffic and Transportation Engineering

基　　金：国家"十五"科技攻关项目(2002BA404A04)

摘　　要：结合公交乘客出行的特点,基于Dijkstra算法站点查询的出行路径选择方法,提出了基于蚂蚁算法的具有最少换乘次数的公交出行路径查询算法。算法利用了蚂蚁寻食出行路径选择的行为特点,通过线路激素强度的更新机制,实现了以换乘次数最少和公交出行站点最少的公交出行路径选择优化目标。算法实际查询结果与实际相符。Considering the character of bus passenger travel, a bus travel transit path query algorithm with the least transfer times was brought out, which was based on ant algorithm and Dijkstra algorithm of bus stops query. Using the path selection character of ant looking for food and the principle of refreshing bus-line's hormone intensity, the algorithm achieved the optimization goals of bus travel path selection, which were the least transfer times and bus stops. Application results show that this method can reflect the real situation. 3 figs, 8 refs.

关 键 词：交通信息工程 公共交通 蚂蚁算法 换乘 路径选择 

分 类 号：U491[交通运输工程—交通运输规划与管理]