选择满意乘车路线的网络方法

The Network Method of Choosing the Satisfied Riding Routes

针对2007年全国大学生数学建模竞赛B题"乘公交,看奥运"提出的公交线路选择问题,讨论了任意两个公交站点间乘车路线的选择问题,分别按照换乘次数最少、时间最短和费用最少的原则,采用求有向网络中任意两点之间最短路的矩阵算法以及指定两点间最短路的Dijkstra算法,对问题进行求解,得到了比较理想的结果。

In this paper, by considering the 2007 CUMCM （B） -To watch the Olympic Games by bus, we have discussed the problem of choosing riding routes. According to the fewest changing times, the shortest time and the least-cost principle, we are seeking to use the Matrix Algorithm between any two stations in the network shortest path and the Dijkstra Algorithm of the shortest path between the two given stations. The problems are solved with satisfied results.