基于数字地图的多目标路径优选方案的研究

最短路径分析是地理信息系统(GIS)中空间网络分析的关键内容之一．面对当前城市道路网、信息传输网中出现的道路拥挤、信息堵塞等问题，在利用一种改进的Dijkstra算法获得单目标最优路径的基础上，从解决路段冲突入手，提出了两种多目标路径优选的实现方案．实践表明，该方案有效可行．中还对算法实现过程中涉及到的基本概念和数据结构进行了介绍．

A Study on the Method of the Digital Map-Based Multi-objects Paths Chosen

In GIS it is necessary to optimize the analysis function of the shortest path as the hinge of spatial network analysis.Faced with problems such as overpopulation,and information jam,we must seek a algorithm of multi-objects paths chosen that can obtain the best optimum effect.The paper uses a modified Dijkstra algorithm to obtain shortest path of a single object,and puts forth two ways that resolve conflict of the sections of a highway to realize multi-objects paths chosen.Experience shows that the method presented in this paper is reasonable and feasible.The paper also introduces some basic concepts and data structures used in the algorithm.