[1]贾俊杰,张勤..一种基于GIS的公交路线最短路径搜索算法[J].郑州大学学报(工学版),2008,29(02):92-94.[doi:10.3969/j.issn.1671-6833.2008.02.023]
　JIA Junjie,Zhang Qin.A GIS based bus route shortest path search algorithm[J].Journal of Zhengzhou University (Engineering Science),2008,29(02):92-94.[doi:10.3969/j.issn.1671-6833.2008.02.023]

点击复制

一种基于GIS的公交路线最短路径搜索算法()

分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:

29

期数:

2008年02期

页码:

92-94

栏目:

出版日期:

1900-01-01

文章信息/Info

Title:

A GIS based bus route shortest path search algorithm

作者:

贾俊杰; 张勤.

长安大学,地质工程与测绘工程学院,陕西,西安,710054, 长安大学,地质工程与测绘工程学院,陕西,西安,710054

Author(s):

JIA Junjie; Zhang Qin

关键词:

GIS;  公交路线;  最短路径;  交通工程

Keywords:

GIS;  Bus routes;  Shortest path;  Traffic engineering

DOI:

10.3969/j.issn.1671-6833.2008.02.023

文献标志码:

A

摘要:

利用公交线路路口作为顶点,简化了传统算法对复杂网络拓扑图的计算;同时,利用乘客出行偏好,引入线网密度来评价乘客的出行方便程度,并提出了一种最短路径快速搜索算法.实验证明,与传统算法相比,该算法明显提高了路径搜索效率.

Abstract:

Using bus line intersections as apex points, the calculation of complex network topology maps by traditional algorithms is simplified. At the same time, based on passengers’ travel preferences, the line network density is introduced to evaluate the convenience of passengers, and a shortest path fast search algorithm is proposed. Experiments show that compared with the traditional algorithm, the proposed algorithm significantly improves the path search efficiency.

常用功能