地铁环境下时变公交网络的最优路算法

通过建立图论模型实现了地铁环境下时变公交网络的出行优化问题.首先,建立了公交地铁网络图及基于此网络图的二分图、映射网络图,并对地铁线路上站点间的权值进行合理倍数的缩小以达到优选地铁的目的.同时,考虑到地铁与公交的时变性,即是否在它们的运营时间段内直接关系到查询到的最优路径.然后给出以换乘次数少为目标的最优路径选择算法.最后用实例来验证了该算法的有效性.

Mathematical Programming Model and Algorithm for Time-Varying Transit Network Based on the Environment of Subway

The optimization of travel for time-varying transit network based on the environment of subway is realized through the establishment of graph theory model. First, bus and subway network graph, bipartite graph and mapping network graph which is based on the network graph are established. The weight between two subway stations is appropriately reduced in order that we can optimize subway. Meanwhile, time variation of bus and subway is considered in this paper. Whether the time we travel is in their operational period is directly related to the optimal path queried. Then, the optimal path selection algorithm based on the purpose of less transfer times and short distance is given. Finally, we use a numerical example to illustrate the solution process of the proposed method.