One of the major road transportation problems is route finding. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is a shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation ...

Network analysis in geospatial information system (GIS) provides strong decision support for users in searching optimal route, finding the nearest facility and determining the service area. Searching optimal path is an important advanced analysis function in GIS. In present GIS route finding modules, heuristic algorithms have been used to carry out its search strategy. Due to the lack of global...

A solution to the shortest path problem in Martinez de la Torre, a city in the state of Veracruz, Mexico, is presented. Dijkstra’s algorithm was applied to find the shortest route and additional parameter that is used to choose the optimal route was also added. The shortest path problem is a specific case of optimization problems and can be addressed using graph theory. From a computational poi...