检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江浙大中控信息技术有限公司,杭州310052
出 处:《计算机系统应用》2017年第11期182-186,共5页Computer Systems & Applications
基 金:浙江省科技计划项目(2017C01016)
摘 要:为解决公交路线轨迹偏移路网以及在GIS路网信息缺失尤其是乡村道路情况下的公交轨迹描绘.论文首先通过深入分析公交车辆GPS数据,分别聚类出线路上下行轨迹点;其次,轨迹点清洗并排序;再次,结合GIS路网基础信息进行地图匹配;最后,根据改进的Dijkstra算法解决路网拓扑结构缺失情况下制作出公交路线轨迹.将该算法实施在A市35条公交线路上,线路匹配成功率为85%,未匹配成功线路由于样本缺失或者路网基础信息错误导致,可见该算法具有较好的准确率和实用性.In order to solve the bus trail problem that bus route trajectory offset road network and GIS road network information is missing, especially on the rural roads, this paper proposes an algorithm of bus route trajectory based on GIS road networks. Firstly, it makes an in-depth analysis of bus GPS data, clustering line up and down track points respectively. Secondly, it cleans the track points and sort. Thirdly, it combines with GIS road network information for map matching. Finally, according to the improved Dijkstra algorithm, it solves the bus trail problem that GIS road network information is missing. The algorithm is applied in City A with 35 bus lines. The successful match rate is 85%.Unsuccessful matches are due to missing samples or wrong road network information. It can be seen that the algorithm has good accuracy and practicability.
关 键 词:DIJKSTRA算法 公交 GIS 地图匹配 轨迹偏移
分 类 号:U491.17[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147