城市公交智能查系统硕士学位论文.docVIP

摘 要 随着城市经济的发展、城市规模的扩大以及人口的增长，城市公交线路也越来越多，靠人脑或者地图来记录查找这些信息变得越来越不方便，因此开发出公交车查询不仅可以。另外,随着城市规模的迅速扩张,越来越多显示不能的需求公交换乘要求基于换乘次数最少为前提查找经历站点最少的换乘方案系统设计采用了基于最少换乘次数的深度优先搜索算法，数据存储采用链表，一条公交线路的线路明细可以看做是一个链表，多条公交线路就组成了邻接多重表。算法首先查找直达线路，然后查找一次换乘，最后递归查找两次以上换乘，查找过程中采用深度优先搜索算法进行遍历。两次以上换乘的实现思路是通过移动起始站点，将N次换乘转化为N-1次换乘，最终都按一次换乘来处理。整个算法目的明确，思路清晰，直奔目标-换乘次数最少为前提的经历站点最少的换乘方案。 /S架构，采用动态网站开发技术，语言使用C#语言，开发工具采用Visual Studio2008集成开发环境，数据库采用SQL Server2005开发而成。 通过系统测试和试用，表明系统功能正确，能够满足广大市民出行需求，可以非常方便的查找公交线路等信息。 关键词：公交智能查询系统，网站，路径算法。 Abstract With the development of urban economy and the expansion of city scale and the growth of population, the city bus lines more and more, rely on the brain or map to record to find these information is becoming more and more inconvenient, thus developed a convenient bus query system, can not only facilitate public travel, is also a powerful propaganda for the citys image. In addition, with the rapid expansion of city scale, more and more bus lines, query, display only a single line detail, can not meet the needs of the user travel route choice. Therefore, this article proposes to design a smart city bus route query system. Paper first on the bus passengers on the basis of the analysis of psychological characteristics, consider the factor of passengers choose bus routes decision-making, key part in the program of algorithm design. Transit requirements based on the change to the minimum as the prerequisite for experience site least transfer plans. System design USES the depth first search algorithm based on minimal transfer times, data storage using linked list, a bus lines line detail can be seen as a linked list, several bus lines comprise the adjacency multiple tables. Algorithm to find the direct line first, and then find a transfer, the recursive search transfer two or more times, used in the process of looking for the traverse depth-first search algorithm. Two or more times a change to the implementation of the approach is by moving the start site, will change