【摘要】：隨著我國經(jīng)濟飛速發(fā)展,城市規(guī)模不斷擴大,公交線路日益增多,路網(wǎng)模型愈來愈復(fù)雜,僅靠人腦記憶或者在地圖查找出行信息變得越來越不方便,利用信息化手段,開發(fā)基于互聯(lián)網(wǎng)的公交智能查詢系統(tǒng),可以大大方便公眾出行。因此,本文在深入分析出行需求的基礎(chǔ)上,提出設(shè)計一種智能城市公交線路查詢系統(tǒng)。首先,論文結(jié)合圖論的知識將公交線路網(wǎng)明確為有向多重圖,并在后面的研究中逐步簡化。然后,針對本系統(tǒng)的難點問題任意站點間最優(yōu)換乘方案查詢問題進行了數(shù)學(xué)建模,通過對公交乘客的出行心理特征分析,確定影響乘客選擇公交線路的三大因素——換乘次數(shù)、行程時間和行程費用,將公交站站查詢問題抽象為基于多約束條件的最短路徑問題。同時,為了使系統(tǒng)能夠簡潔高效的運行,并未采用復(fù)雜的算法,而是結(jié)合公交系統(tǒng)特殊性和對實際問題的多方面研究討論對以上三個約束條件進行了合并簡化,簡化為換乘次數(shù)這一個約束條件,最終提出最佳公交換乘方案就是以換乘次數(shù)最少為前提的經(jīng)歷站點最少的換乘方案,設(shè)計了基于最少換乘次數(shù)約束的深度優(yōu)先搜索算法。在此基礎(chǔ)上,論文研究開發(fā)了公交智能查詢系統(tǒng),該系統(tǒng)基于B/S架構(gòu),采用asp.net動態(tài)網(wǎng)站開發(fā)技術(shù),語言使用C#語言,開發(fā)工具采用Visual Studio2008集成開發(fā)環(huán)境,數(shù)據(jù)庫采用SQL Server2005開發(fā)而成。通過系統(tǒng)測試,表明系統(tǒng)功能正確,滿足廣大市民出行需求,可以非常方便的查找公交線路等信息。
[Abstract]:With the rapid development of our country's economy, the city scale is expanding, the bus route is increasing, the road network model is becoming more and more complicated, it is more and more inconvenient to rely on the human brain to memorize or find the travel information in the map, so it is more and more convenient to use information technology. The development of Internet-based bus intelligent inquiry system can greatly facilitate the public travel. Therefore, based on the in-depth analysis of travel demand, this paper proposes the design of an intelligent city bus route query system. Firstly, the paper combines the knowledge of graph theory to define the bus line network as directed multiple graph, and then simplifies it step by step in the following research. Then, aiming at the difficult problem of this system, the query problem of optimal transfer scheme between any stations is modeled. Through the analysis of the travel psychological characteristics of public transport passengers, the three major factors that affect passengers' choice of bus routes are determined: the number of times of transfer. The query problem of bus station is abstracted as the shortest path problem based on multi-constraint condition. At the same time, in order to make the system run succinctly and efficiently, the complex algorithm is not used, but combined with the particularity of the public transport system and the multi-aspect research on the practical problems, the above three constraints are combined and simplified. Finally, the best bus transfer scheme is put forward as the least number of transfer times, and a depth first search algorithm based on the minimum number of transfer times is designed, which is based on the minimum number of transfer times. On this basis, the paper studies and develops the bus intelligent query system. The system is based on B / S architecture, adopts asp.net dynamic website development technology, uses C # language, and adopts Visual Studio2008 integrated development environment. The database is developed by SQL Server2005. Through the system test, it shows that the system functions correctly, meets the public travel needs, and can easily find information such as bus lines.
【學(xué)位授予單位】：長安大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U495;TP311.52

【參考文獻】

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

1 張國伍;北京市公共交通智能化調(diào)度管理系統(tǒng)的建設(shè)與開發(fā)[J];北方交通大學(xué)學(xué)報;1999年05期

2 楊新苗,王煒,馬文騰;基于GIS的公交乘客出行路徑選擇模型[J];東南大學(xué)學(xué)報(自然科學(xué)版);2000年06期

3 許軍林;蔣年德;;一種改進的公交換乘算法的實現(xiàn)[J];電腦知識與技術(shù)(學(xué)術(shù)交流);2007年14期

4 張研;韓露;;用廣度優(yōu)先搜索算法實現(xiàn)路徑搜索[J];電腦編程技巧與維護;2012年19期

5 蔚潔;楊懷雷;成汝震;;基于Dijkstra算法的最優(yōu)路徑搜索方法[J];河北師范大學(xué)學(xué)報(自然科學(xué)版);2008年05期

6 傅冬綿;交通系統(tǒng)中最少換乘算法及其實現(xiàn)[J];華僑大學(xué)學(xué)報(自然科學(xué)版);2001年04期

7 李海霞;;圖搜索策略與深度優(yōu)先搜索的實現(xiàn)[J];考試周刊;2009年01期

8 楊潔霞;;基于實用型的E-R圖教學(xué)探討[J];信息與電腦(理論版);2010年06期

相關(guān)碩士學(xué)位論文 前1條

1 朱文軒;智能公交查詢系統(tǒng)的設(shè)計與實現(xiàn)[D];鄭州大學(xué);2014年

，

本文編號：2154522