【摘要】：城市公共交通是整個城市交通系統(tǒng)中的一個重要組成部分,它的發(fā)展有利于提高人民的生活水平,對社會經(jīng)濟(jì)活動和城市生活意義重大。城市公共交通發(fā)展水平是衡量城市現(xiàn)代化程度的重要標(biāo)志,也是解決大中城市交通擁擠問題的最佳途徑,而基于公交網(wǎng)絡(luò)的最優(yōu)路徑選擇是城市公共交通中的一個重要方面,是公共交通優(yōu)先的保證。本文利用GTFS文件的公交數(shù)據(jù)信息,建立公交網(wǎng)絡(luò),在確定起點和終點公交站后能夠快速計算最優(yōu)公交路線。主要完成以下內(nèi)容:首先,分析谷歌提供的GTFS文件及其數(shù)據(jù)存儲結(jié)構(gòu),轉(zhuǎn)換數(shù)據(jù),生成公交路線線形,并加入公交站點,建立公交網(wǎng)絡(luò),在此基礎(chǔ)上計算公交最優(yōu)路線;其次,查找并存儲換乘點,如果從起點到終點沒有直達(dá)路線,通過在一定范圍內(nèi)查找換乘點,只需獲取整個公交網(wǎng)絡(luò)的一小部分?jǐn)?shù)據(jù),提高了可行公交路徑的計算效率;另外,計算經(jīng)過站點的路線,這樣就能夠快速獲取經(jīng)過站點的路線信息;最后,在公交路網(wǎng)中確定起點和終點公交站,計算從起點到終點的可行公交路徑,經(jīng)過公交站點數(shù)最少的可行公交路徑為最優(yōu)公交路線。在計算可行公交路徑集合時,首先考慮是否需要換乘,如果沒有直達(dá)路線才計算換乘路線,因為大多數(shù)乘客最多一次換乘就能到達(dá)目的地,所以算法在計算可行公交路徑時只考慮直達(dá)、一次換乘和兩次換乘的情況。
[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.
【學(xué)位授予單位】：長安大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U491.17

【共引文獻(xiàn)】

相關(guān)期刊論文 前7條

1 孟慶和;李大龍;;快速公交的特點及應(yīng)用[J];農(nóng)業(yè)裝備與車輛工程;2006年08期

2 韓穎;姚佳;郭凱;陳順治;劉霄宇;;基于MO的奧運交通路線查詢系統(tǒng)——從北京火車站到國家體育場[J];首都師范大學(xué)學(xué)報(自然科學(xué)版);2008年03期

3 蘇嘯;曾子維;;基于關(guān)聯(lián)的城市公交換乘查詢算法[J];計算機(jī)工程與設(shè)計;2006年03期

4 王正君;劉美爽;柳艷杰;;在交通中發(fā)展BRT的可行性分析[J];森林工程;2008年03期

5 薛新友;;淺談Web GIS與公交線路查詢系統(tǒng)設(shè)計[J];科技創(chuàng)新與生產(chǎn)力;2011年07期

6 何瑞春;李引珍;;時間依賴網(wǎng)絡(luò)路徑模型及雙層優(yōu)化智能算法研究[J];鐵道學(xué)報;2008年01期

7 陳培軍;王欣潔;;基于矩陣的公交查詢高效算法[J];太原科技大學(xué)學(xué)報;2011年01期

，

本文編號：2386673