Finding Shortest Path By Using A* and Dijkstra Algorithm

shortest path problem is a fundamental technique in computer networking for route discovery. Utilizing the shortest path algorithms overall costs of setting the network is reduced. Many new technologies are implemented using the shortest path problem e.g. the road map system. Shortest path problem is an optimization technique [1] used in many applications. In this paper's different shortest path algorithms are studied i.e. Dijkstra's Algorithm, A* Search, FloydWarshall Algorithm, Johnson's Algorithm and Bellman-Ford Algorithm. We will study or analyze the behavior of different algorithms of shortest path in this paper. First we will study each algorithm to analyze its performance and then we will compare algorithms on the basis of their time complexity.

The research on the time-varying network path optimization algorithm is mainly based on actual phenomenon in actual traffic system and the results of statistical analysis about traffic flow. The algorithm is supplemented and improved combining with the time-varying network optimal path algorithm proposed in the literature, explaining some details which is not provided in the literature. The purpose of improving the algorithm is to reduce the complexity of searching, improving the efficiency of the system, and makes it more close to meet the demands of engineering.

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.

International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2022

Nowadays, vehicle tracking is extremely useful for many things: personal vehicle security, public transportation management, fleet management, and mass transit management, among others. It is common for passengers to use public transport applications that propose the best route for them. Users may prefer a different route for public transportation depending on their preferences. Most users find the shortest route based on this criteria when choosing an ideal route. The shortest path is frequently determined using Dijkstra's Algorithm, according to our research. For this project, we designed a GIS application to improve public transportation using Geographic Information Systems (GIS). Based on the system's real-time location tracking, Dijkstra's algorithm provides taxis with the appropriate category for passengers. With this system, taxi drivers will not have to drive across town to pick up passengers, as confirmations will be sent directly to their phones. If you frequently have to wait for a taxi that has been booked, this will be helpful, especially if you are frequently left waiting.

Journal of Physics: Conference Series, 2019

City transportation is a motorized vehicle with a fixed line that connects one area to another in one city. Information about the city transportation route in Semarang has been provided by the Department of Transportation of Semarang city which contains the code and route. The development of science regarding the route search algorithm method or the shortest path can be used to support the path search based on the city transportation route. A geographical information system is a system designed to work using data that has spatial reference spatial information. At this time the technology has not been applied optimally to support the search for the shortest route of urban transport based on the city transportation route. This study aims to develop the application of the shortest pathway determination based on the city transportation route in Semarang using the Floyd Warshall algorithm based on Geographic Information System. City transportation route data can be implemented in graph f...

 Abstract— Network is defined as a combination of two or more nodes which are connected with each other. It allows nodes to exchange data from each other along the data connections. Routing is a process of finding the path between source and destination upon request of data transmission. There are various routing algorithms which helps in determining the path and distance over the network traffic. For routing of nodes, we can use many routing protocols. Dijkstra's algorithm is one of the best shortest path search algorithms. Our focus and aim is to find the shortest path from source node to destination node. For finding the minimum path this algorithm uses the connection matrix and weight matrix Thus, a matrix consisting of paths from source node to each node is formed. We then choose a column of destination from path matrix formed and we get the shortest path. In a similar way, we choose a column from a mindis matrix for finding the minimum distance from source node to destination node. It has been applied in computer networking for routing of systems and in google maps to find the shortest possible path from one location to another location.

fportfolio.petra.ac.id

In the programming world there are so many algorithms that can be used to do an optimal path finding, for example Dijkstra, Ant and A* algorithm. However, there has been little work on the benchmarking in terms of the performance analysis of these algorithms [3, 7]. In this ...

Journal of Physics: Conference Series, 2019

The purpose of this Decision Support System (DSS) design is to analyze the nearest route of a position, which then carried out financing analysis for transportation to the specified location. The design methodology of this study is the Android-based application system by utilizing the mapping of the region on the hardware in the form of a smartphone. The analysis model chosen for this DSS is Dijkstra algorithm. The subject of system user is Coordinator of Islamic Higher Education (KOPERTAIS) region II for West Java and Banten. The design results show the good system capabilities of the system to select and determine the nearest route and estimate the cost of official travel so that official travel can be efficiently done based on the time and cost perspective.

Journal of Land Management and Geomatics Education, 2021

Transportation is one of the major parameters of socioeconomic development. Monitoring road feasibility study and understanding the dynamic of socioeconomic factors is increasingly important in sustainable development and management of roadway transportation. This paper uses Geographic Information System (GIS) to explore the various route alternatives from Janakpur to Birgunj that will touch all the major settlement area in between. A least cost model was created in ArcGIS and weighted overlay was performed to find the weighted cost raster. Different influencing parameters like land use pattern, slope, settlement, existing linear features and ecology of the study area were assigned proper weights and accordingly their class types to work on with overlay algorithm. Cost distance was computed from cost raster and the least cost path between source and destination was found using cost path function in ArcGIS. The Least Cost Path (LCP) model applied for the mentioned route paths were quite successful in avoiding forest, faults, high slopes and zones of ecological or cultural values, and thus satisfying the objective of this study within the given criteria and data. This paper concludes that if Geographic Information System and shortest path algorithm is embedded in the early planning system, it proves to be well suited, economic and time-saving for a sustainable corridor location design.

Network analysis is an essential tool used in transport sector, information sector and also for the flow of matter and energy. Thus, choosing efficient route is essential for businesses and industries which aid distribution of goods and services optimally. This research addresses the problem of Dominion Paints Nig. Ltd in transporting their products from their production plant to stores of sales by presenting analysis of the shortest path using Dijkstra's Algorithm and it was concluded that the best paths found from the analysis will save the company less distance in transporting the paints and minimize time and cost of fueling their vehicles. The analysis shows that the best route which provides the shortest distance will be from node 1 – 3 – 5 – 8 (Aluu – Rumuosi – Location – Mile 3), when transporting from Aluu (the production location) to Mile 3 the company's major sales point with a total distance of km. A TORA software (version 2006) was used in the analysis.