交通运输工程与信息学报

求解公交网络最优路径是进行公共交通系统规划的一项关键技术。通过对多种现有算法的分析,利用公交换乘矩阵性质,本文提出了一种求解公交网络最优路径的标准算法。新算法考虑了公交换乘次数、换乘点选择以及出行总成本对求解最优路径的综合影响。通过建立换乘步行时间矩阵,并将过去求解最小换乘次数的换乘矩阵乘法运算变为相应的换乘步行时间矩阵和公交出行时间矩阵的加法运算,得到新算法。新算法可顺利实现在单一OD对、单起点多终点以及任意节点间求解最优路径的转化。文中给出了新算法的详细求解步骤,而且通过一个算例对新算法的有效性进行了验证。

Public transit route choice algorithm is a key technology for public transit system planning. Through analyzing many shortest path algorithms in transit network, according to the characteristic of public traffic transfer matrix, a new standard algorithm is proposed to find an optimal path in transit network. Transfer times, transfer point choice and the travel cost are taken into consideration in the new algorithm. Through constructing transfer walk-time matrix and transforming the multiplication of transfer matrix to the addition of transfer walk-time matrix and public traffic travel-time matrix, the new algorithm is brought forward. It’s easy to transfer the algorithm among single OD pair, single original with multi-destination and any other OD pair. The article elaborates on the basic applied steps of the new algorithm. In the end, a simple numerical example is given to show the new algorithm’s efficiency.