论文部分内容阅读
本文采用了图论的方法,提出了求路径集将路径部分复盖的最少单复盖路径组的问题,在已知公共汽车线路方案的情况下,解决了求客流的总乘车数,总步行数及总换乘车次数的问题,为线路方案的优选提供了必要的数据。
In this paper, the method of graph theory is used to solve the problem of seeking the least single-covered path group that the path set covers the path part. In the case of known bus line scheme, The number of pedestrians and the total number of transfer trips provided the necessary data for the optimization of the route plan.