首页 | 本学科首页   官方微博 | 高级检索  
     

基于城市道路网的最短路径分析解决方案
引用本文:刘云翔,陈荦,李军,陈宏盛.基于城市道路网的最短路径分析解决方案[J].小型微型计算机系统,2003,24(7):1390-1393.
作者姓名:刘云翔  陈荦  李军  陈宏盛
作者单位:国防科技大学,电子科学与工程学院,湖南,长沙,410073
摘    要:近年来GIS对网络分析功能的需求迅速增长.网络分析中的一个关键问题是最短路径问题,它作为许多领域中速择最优问题的基础,在交通网络分析系统中占有重要地位.由于最短路径分析常用于汽车导航系统以及各种城市应急系统(如l10报警、l19火警以及120急救系统),本文针对城市道路网的特点,提出了一种实用、高效的最短路径分析解决方案.

关 键 词:最短路径  Dijkstra算法  城市道路网
文章编号:1000-1220(2003)07-1390-04

An Implementation of the Shortest Path Analysis Based on City Road Network
LIU Yun Xiang,CHEN Luo,LI Jun,CHEN Hong Sheng.An Implementation of the Shortest Path Analysis Based on City Road Network[J].Mini-micro Systems,2003,24(7):1390-1393.
Authors:LIU Yun Xiang  CHEN Luo  LI Jun  CHEN Hong Sheng
Abstract:In recent years, Network analyses have become more and more important in GIS. As the key problem of network analyses, computing shortest paths over a network has become an important task in many network and transportation related analyses. Shortest path analysis is often used in vehicle navigation system and city emergency systems. This paper introduces a practical and efficient realization of shortest path analysis according to the characteristics of city road network. We run our algorithm on a middle range personal computer with relatively large dataset. The experimental result is very promising, thus proves the efficiency of the proposed algorithm.
Keywords:shortest path  dijkstra algorithms  road network
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号