新型公交网络模型与最优线路选择算法

New urban transit network models and optimal path searching algorithm

针对公交线路的最优线路选择问题,给出了基于标号公交网络二分图模型,在此模型基础上给出了最小换乘条件下的可行线路的"纺锤-修剪"搜索算法,进而给出在最小换乘条件下的最短路径和换乘站点的数学规划方法.最后给出算例并验证了该方法的有效性.

A bipartite labeled graph model is given for optimal path problem in urban transit network. Based on this model, the minimum transfer line is given by the transfer searching algorithms named ＂spindle-pruning＂ query algorithm. Furthermore, a mathematical programming method is designed to obtain the shortest feasible path and transfer sites. Finally, an example using the query method is given to show the effectiveness of the method.