城市公交路网最优路线算法研究
发布时间：2018-12-19 08:30
【摘要】：城市公共交通是整个城市交通系统中的一个重要组成部分,它的发展有利于提高人民的生活水平,对社会经济活动和城市生活意义重大。城市公共交通发展水平是衡量城市现代化程度的重要标志,也是解决大中城市交通拥挤问题的最佳途径,而基于公交网络的最优路径选择是城市公共交通中的一个重要方面,是公共交通优先的保证。本文利用GTFS文件的公交数据信息,建立公交网络,在确定起点和终点公交站后能够快速计算最优公交路线。主要完成以下内容:首先,分析谷歌提供的GTFS文件及其数据存储结构,转换数据,生成公交路线线形,并加入公交站点,建立公交网络,在此基础上计算公交最优路线;其次,查找并存储换乘点,如果从起点到终点没有直达路线,通过在一定范围内查找换乘点,只需获取整个公交网络的一小部分数据,提高了可行公交路径的计算效率;另外,计算经过站点的路线,这样就能够快速获取经过站点的路线信息;最后,在公交路网中确定起点和终点公交站,计算从起点到终点的可行公交路径,经过公交站点数最少的可行公交路径为最优公交路线。在计算可行公交路径集合时,首先考虑是否需要换乘,如果没有直达路线才计算换乘路线,因为大多数乘客最多一次换乘就能到达目的地,所以算法在计算可行公交路径时只考虑直达、一次换乘和两次换乘的情况。
[Abstract]:Urban public transportation is an important part of the whole urban transportation system. Its development is conducive to improving the living standards of the people and is of great significance to social economic activities and urban life. The development level of urban public transport is an important symbol to measure the degree of urban modernization and the best way to solve the problem of traffic congestion in large and medium-sized cities. The optimal route selection based on public transport network is an important aspect of urban public transport. It is a guarantee of public transport priority. In this paper, the bus network is established by using the public transport data information of the GTFS file, and the optimal bus route can be calculated quickly after determining the starting point and the terminal bus station. The main contents are as follows: first, analyze the GTFS file provided by Google and its data storage structure, transform the data, generate the line shape of the bus route, join the bus station, establish the public transport network, calculate the optimal bus route on this basis; Secondly, if there is no direct route from the starting point to the end, only a small part of the data of the whole bus network can be obtained, and the calculation efficiency of the feasible bus path can be improved. In addition, the route passing through the station is calculated, so that the route information passing through the site can be obtained quickly; Finally, determine the starting point and the terminal bus station in the public transport network, calculate the feasible bus route from the starting point to the end, the feasible bus route passing through the least number of bus stations is the optimal bus route. When calculating the set of viable bus routes, first consider whether you need to transfer, if there is no direct route to calculate the transfer route, because most passengers can arrive at their destination at most once. Therefore, the algorithm only considers the direct, one and two times transfer when calculating the feasible bus route.
【学位授予单位】：长安大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U491.17
本文编号：2386673
[Abstract]:Urban public transportation is an important part of the whole urban transportation system. Its development is conducive to improving the living standards of the people and is of great significance to social economic activities and urban life. The development level of urban public transport is an important symbol to measure the degree of urban modernization and the best way to solve the problem of traffic congestion in large and medium-sized cities. The optimal route selection based on public transport network is an important aspect of urban public transport. It is a guarantee of public transport priority. In this paper, the bus network is established by using the public transport data information of the GTFS file, and the optimal bus route can be calculated quickly after determining the starting point and the terminal bus station. The main contents are as follows: first, analyze the GTFS file provided by Google and its data storage structure, transform the data, generate the line shape of the bus route, join the bus station, establish the public transport network, calculate the optimal bus route on this basis; Secondly, if there is no direct route from the starting point to the end, only a small part of the data of the whole bus network can be obtained, and the calculation efficiency of the feasible bus path can be improved. In addition, the route passing through the station is calculated, so that the route information passing through the site can be obtained quickly; Finally, determine the starting point and the terminal bus station in the public transport network, calculate the feasible bus route from the starting point to the end, the feasible bus route passing through the least number of bus stations is the optimal bus route. When calculating the set of viable bus routes, first consider whether you need to transfer, if there is no direct route to calculate the transfer route, because most passengers can arrive at their destination at most once. Therefore, the algorithm only considers the direct, one and two times transfer when calculating the feasible bus route.
【学位授予单位】：长安大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U491.17
【共引文献】
相关期刊论文 前7条
1 孟庆和;李大龙;;快速公交的特点及应用[J];农业装备与车辆工程;2006年08期
2 韩颖;姚佳;郭凯;陈顺治;刘霄宇;;基于MO的奥运交通路线查询系统——从北京火车站到国家体育场[J];首都师范大学学报(自然科学版);2008年03期
3 苏啸;曾子维;;基于关联的城市公交换乘查询算法[J];计算机工程与设计;2006年03期
4 王正君;刘美爽;柳艳杰;;在交通中发展BRT的可行性分析[J];森林工程;2008年03期
5 薛新友;;浅谈Web GIS与公交线路查询系统设计[J];科技创新与生产力;2011年07期
6 何瑞春;李引珍;;时间依赖网络路径模型及双层优化智能算法研究[J];铁道学报;2008年01期
7 陈培军;王欣洁;;基于矩阵的公交查询高效算法[J];太原科技大学学报;2011年01期
，本文编号：2386673
本文链接：https://www.wllwen.com/kejilunwen/daoluqiaoliang/2386673.html
