Volume XL-2/W3
Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XL-2/W3, 69-71, 2014
https://doi.org/10.5194/isprsarchives-XL-2-W3-69-2014
© Author(s) 2014. This work is distributed under
the Creative Commons Attribution 3.0 License.
Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XL-2/W3, 69-71, 2014
https://doi.org/10.5194/isprsarchives-XL-2-W3-69-2014
© Author(s) 2014. This work is distributed under
the Creative Commons Attribution 3.0 License.

  22 Oct 2014

22 Oct 2014

MODIFIED A* ALGORITHM IMPLEMENTATION IN THE ROUTING OPTIMIZED FOR USE IN GEOSPATIAL INFORMATION SYSTEMS

S. M. Ayazi1, M. F. Mashhorroudi2, and M. Ghorbani3 S. M. Ayazi et al.
  • 1Head of Data Processing in NCC – NE General Administration, PhD. Student at Department of Surveying and Geomatics Engineering, University of Tehran, Iran
  • 2MSc. Student of GIS/Remote Sensing, Expert of Computer – NE General Administration, Mashhad, Iran
  • 3MSc. GIS/Remote Sensing, Expert of RS in NCC – NE General Administration, Mashhad, Iran

Keywords: GIS, Routing Optimization, Graph Theory, A* Algorithms, Modelling

Abstract. Among the main issues in the theory of geometric grids on spatial information systems, is the problem of finding the shortest path routing between two points. In this paper tried to using the graph theory and A* algorithms in transport management, the optimal method to find the shortest path with shortest time condition to be reviewed. In order to construct a graph that consists of a network of pathways and modelling of physical and phasing area, the shortest path routes, elected with the use of the algorithm is modified A*.At of the proposed method node selection Examining angle nodes the desired destination node and the next node is done. The advantage of this method is that due to the elimination of some routes, time of route calculation is reduced.