Dijkstra算法在GIS车辆诱导系统的优化实现  

Efficient implementation of Dijkstra algorithm in vehicle route guidance system based on GIS

作　　者：殷招伟 戴文博[1] 钱俊彦[1] 

机构地区：[1]桂林电子科技大学计算机科学与工程学院,广西桂林541004

出　　处：《大众科技》2015年第2期25-28,共4页Popular Science & Technology

摘　　要：为了满足人们日益增长的出行需求,跨学科的智能交通系统应运而生。最短路径分析是GIS车辆诱导系统应用的关键问题,Dijkstra算法是解决该问题的常用算法。文章结合二树Dijkstra算法的思想和现代多核多线程的技术,对Dijkstra算法进行了优化与改进,并对该算法在车辆诱导系统中的应用进行了探讨。该系统以桂林市为例模拟了最短路径搜过程,证明该算法的高效性和实用性。The interdisciplinary application of intelligent transportation system comes into being just to meet people’s growing demand.The analysis of shortest path is the key problem in the application of VRGS （Vehicle Route Guidance System）, the Dijkstra algorithm is the common algorithm to solve this problem effectively. Combined two-tree Dijkstra algorithm and multi-core and multi-threading technology, this paper optimizes and improves the traditional Dijkstra algorithm. And it discusses the application of the algorithm in VRGS.At last, this paper poves its practicality and efficiency by simulating the shortest path search process of Guilin.

关 键 词：最短路径 DIJKSTRA算法 车辆诱导系统 

分 类 号：U49[交通运输工程—交通运输规划与管理]