论文部分内容阅读
文章通过研究比较拉萨市现有公交线路,对16个关键点进行实地调查,统计各关键点的客流量以及各个相邻关键点之间的距离。根据所得数据利用迪克斯特拉算法找到最短备选路线集合,并计算出单位长度最大效益。结合实际情况对站点重新优化调整,整合成网,形成优化公交线路网络。
By studying and comparing the existing bus lines in Lhasa, the article conducts field surveys on 16 key points and calculates the traffic volume of each key point and the distance between each adjacent key point. According to the obtained data, we use Dexter algorithm to find the shortest candidate route set and calculate the maximum benefit per unit length. According to the actual situation of the site to re-optimize the adjustment, integrated into a network to form an optimized bus line network.