Abstract: The algorithm for the Shortest Path was proposed based on characteristics of Intercity Public Transportation System. The main aim is at the selection of transfer paths. The least transfer and lowest generalized expense of time and price were solved. This paper firstly presents a way which based on the Floyd algorithm to obtain the least transfer matrix and multiple shortest path，then it calculates the generalized expense of all the least transfer paths by station － line search method.

Key words: intercity transportation, the shortest path, least transfer matrix, generalized expense

摘要： 在借鉴城市公共交通最短路算法的基础上，针对城际网络的特点，研究了城际交通换乘路径的选择问题。以 最小换乘次数为首要目标，并以此为基础，综合考虑时间、票价等因素，获取城际交通系统最短路。首先提出一种 基于Flord算法的最小换乘矩阵及多条最短路的获取方法，然后利用最小换乘路径进行站线搜索与广义费用计算， 获取城际交通的最短路，最后通过算例证明了本算法的可行性。

关键词: 城际交通, 最短路, 最小换乘矩阵, 广义费用