《公交网络路径算法研究》【毕业设计论文】.docVIP

精品 PAGE 题 目： 公交网络路径算法研究 摘 要 城市公交查询系统为乘客提供了优化、及时的信息服务，通过合理的引导，很大程度上方便了他们的出行，同时减少了不必要的交通流量，提高了整个公交网络的运行效率和城市信息服务化水平。在公交查询系统中，最关键的问题就是出行路径的选择问题。为了帮助乘客方便地选择出行路径、换乘路线等，本文对公交网络路径算法进行了如下研究。 首先分析了现有的几种的公交查询算法，并通过比较，确定了本文的研究思路，归纳出本文工作需要解决的关键问题。在此基础上，本文研究了国内公交网络的主要特点，以及乘客的出行心理，建立了多目标规划的数学模型。最后在上述数学模型基础上，提出了一种最优公交网络路径算法，该算法以广度优先遍历为基础，是一种优化的公交网络路径算法。 本文在基于J2EE的环境下，实现了一个具有一定通用性的公交线路查询系统，在此系统下验证了算法的可行性和高效性。 关键词：J2EE；最短路径算法；公交网络；线路查询 ABSTRACT Urban public transport inquiry system provides the optimizated and quick information service to facilitate passengers’ travel in a large extent though a reasonable guide. And at same time, this kind of system can reduce the unnecessary traffic flow and improve operation efficency of entire public transportation network and the level of urban information services. In public transport inquiry system，the key problem is travel path selection problem. In order to help passengers conveniently select travel path and transfer route ,the paper researched the public transport algorithm. Firstly, several existing public transport inquiry algorithms including their superiority and inferiority are analyzed in the paper. Secondly the key problems that need to be solved in this work are also concluded. On this basis, a multi-objective programming mathematical model of public transport inquiry is established. Finally，on the ground of above mathematical model，a kind of optimization algorithm about public transport inquiry is proposed. The algorithm is based on breadth-first traversal which is a kind of optimization algorithm about public transport inquiry. In the J2ME environment, the paper implements a Public Transport Inquiry System in which the feasibility and efficiency of the algorithm is verified. Key words：J2EE; Shortest path algorithm; Public transport network; Inquiry of route 目 录 TOC \o 1-3 \h \z \u 第一章 绪论 1 1.1 研究背景 1 1.2 项目的主要研究工作 1 1.3开发环境 2 第二章 理论基础 3 2.1 概念 3 2.2 J2EE的结构 3 2.3 J2EE的容器类型 4 2.4 J2EE的体系与模式