摘要
针对Dijkstra算法在公交乘换应用领域存在计算量大、实时性不高、网络负载压力大、滞留时间长且乘换不经济等缺陷,基于WebGIS技术提出一种改进型智能公交乘换模型,将乘换次数和乘车前后总站数优先考虑,从而构造出中转站及其线路对应的路线-站点换乘矩阵,获得最优公交换乘线路。
The application of Dijkstra algorithm and its advanced version in electronic map in solving the shortest route problem was examined. Disadvantages of the algorithm in dealing with the intelli- gent interchange of the public transportation area were studied, such as computation complexity, lack of real time, heavy-loaded network, prolonged detention time and uneconomic transtation. An improved model which priotizes the number of transtation and the total number of stops was pre- sented. The optimal transferred route of the public transportation system was obtained. A line-station transfer matrix including transit station and its routes corresponding to the optimal route was derived.
出处
《福建工程学院学报》
CAS
2012年第3期275-278,共4页
Journal of Fujian University of Technology
基金
福建省教育厅JK类项目(JK2011036)
福建省教育厅JK类项目(JK2010041)