交通网络中最短路径算法的研究-控制理论与控制工程专业论文.docxVIP

重庆大学硕士学位论文 重庆大学硕士学位论文 英文摘要 ABSTRACT With the prevalence of the computer and the network，and the development of Geographical Information Science，Geographical Information System(GIS)has great application for powerful function．Network analysis，as one of the most primary function，has an impact upon many network include electronic navigation、traffic tour、 city planning、electric power、communication and SO on．Shortest path problern is one of the primary problems ofnetwork analyss． As the base ofoptimal selection problem in many fields， computing shortest paths OVer a network has become an important task in many transportation and network analyses systems． Shortest path analysis has been widely used in vehicle location system and city emergency systems． The paple describes some primary conceptions about the G1S，including the concept，mathematics model，the framework and manage of data，network analysis of GIS． The paper studies and tests the key techniques of shortest path analysis．We set focus on solutions which include the vector map representation of city road networV．the abstraction and construction of the topolog_ical structure of network,and the efficient implementation ofshortest path algorithm． Based on the fact of GIS networks，we start with construction of the topolo西cal structure of network and the realization of rapid search technology of Dijkstra algorithm，and propose the improved Dijkstra shortest algorithm，which improve the traditional operations of binheap optimal array on the base of limiting region of using ellipse．It is based on the statistical analysis of character of city transportation space distributing，and design a reasonable limiting region of using ellipse to reduce the scale of the search of the algorithm．And it makes use of the theory that the beeline is the shortest between two points，and we get the new greedy search strategy,which is determined