Anapplication of Dijkstra's Algorithm to shortest route problem

International Journal of Advanced Remote Sensing and GIS, 2017

Many route mappings were done with the help of API of Google maps but do not provide geospatial Routing functionality like overlay, interpolation etc. This project aims to find the shortest path between two or more points by using multipath Dijkstra's algorithm via PgRouting. Dijkstra's algorithm provides advantages on time required for selecting the network and building graph over the algorithm speed. In that case, A-star is always preferred over Dijkstra's algorithm. Dijkstra's algorithm has a computational complexity of O (n2) with a network consisting of n nodes. This Project explains the steps to prepare the data by converting shape files into SQL files and import it into PostgreSQL/PostGIS, make routing topology, indexes, and queries, dynamically assign costs by PgRouting, and write a custom function 'plpgsql' using PL/pgSQL (Procedural programming structured query language) supported by PostgreSQL. This report provides all geospatial functions with dynamic support via PgRouting which allows many clients, like Quantum GIS and Udig, represents client visualization for modification of data and attributes for instantly reflecting changes via PgRouting. PgRouting Provides a framework by which cost parameters are calculated dynamically. This paper specifies the routing of Varanasi city roads using Dijkstra's algorithm and PgRouting. This article focuses on dynamic routing on the complex network like Varanasi City over the web mapping application so that Client can easily find their shortest route along with Cost parameters.

Pakistan Journal of Commerce and Social …, 2009

Optimization is a key factor in almost all the topics of operations research / management science and economics. The road networks can be optimized within different constraints like time, distance, cost and traffic running on the roads. This study is based on optimization of real road network by means of distances. Two main objectives are pursued in this research: 1) road distances among different routes are composed in detail; 2) two standard algorithms (Dijkstra and Floyd-Warshall algoritms) are applied to optimize/minimize these distances for both single-source and all-pairs shortest path problems.

Applied Sciences

This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption. Dijkstra´s algorithm solves many of the shortest path problems observed in the production planning of raw materials. The algorithm requires knowledge of the relative distance between the vertices and the definition of the Euclidean distance of the vertices from the target vertex. The algorithm scans all of the paths and chooses the one with the minimum distance. At the same time, it would be able to identify the places of sale of raw materials and transport sites for the transportation of raw materials. It would have a database of point and line sources of occurrence (mining, deposit), places of transport (transmission network), and points of sale (seller). At present, geo-statistics is becoming an essential tool for solving various problems in modern deposit geology. Its results are used to calculate reserves a...

IJID (International Journal on Informatics for Development)

The best route is the path found based on the minimum price of a train journey using the Dijkstra and Floyd-Warshall algorithms. This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. The results of these two algorithms are compared using 4 parameters: time complexity, memory complexity, level of completion and level of optimization. Based on the comparison results from the implementation that Dijkstra's algorithm has a time complexity of 81 faster than the Floyd-Warshall algorithm. For the memory complexity, Dijkstra's algorithm uses a memory of 512616 bytes less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes less than the Floyd-Warshall algorithm. For the level of completion of the two algorithms, there is no error. In addition, for the level of optimization the Dijkstra algorithm has advantages in this study, namely the data used is dynamic or variable data in each stage of the process.

2019

This paper is intended to present optimal route finding system for road network application. It is used to operate in complicated mapping situations and new unknown environments. This technique can be implemented to find the optimal path from source to destination in region of map. This system use A* and Dijkstra algorithms to draw plan and develop the Geographic Information System(GIS) assisted optimal road network route finding and give shortest path. The optimal (or) shortest path based on distance or time or cost. And then evaluates the performance of these two algorithms.

International Journal of Engineering & Technology

The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve.

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...

JKIE (Journal Knowledge Industrial Engineering)

Distribution is an activity carried out to spread the product throughout the market so that consumers can buy it. Distribution can also affect the price of goods. Therefore, the distribution must be effective. The purpose of this study is to determine the shortest route that is effective in distribution so that product prices are not high and the company does not suffer losses. The data analysis method used is Dijkstra's Algorithm obtained with data on the distance between the starting point and the destination point through predetermined points. The calculation results show that the shortest and fastest routes to be taken based on the dijkstra algorithm are: A-20-19-F-26-C-D-11-12-B-E with a distance of 40.71 km. There are several road routes that can be chosen to be used but the shortest route that can be taken is 40.71 km. Medan Rice Distributors are expected to choose the shortest transportation route so that rice distribution can be carried out quickly and optimally.

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.

Applied Mathematical Sciences, 2014

Harumanis, Ltd. *) is a company that engage in the supply of fruits. Recently it also had to meet the highly demand of domestic consumer. Harumanis, Ltd. want to determine the best transportation route it had. Transportation is the movement of products from one location to another so that the goods reach up into the hands of consumers. Transportation will be discussed relating to the distribution of goods to the consumer. It is used to determine delivery routes or paths passed by any vehicle that will distribute these items by considering consumer demand and the number of cargo vehicles. It will be influenced and related to transportation costs that be incurred any time the company deliver goods to consumers. Saving methods matrix (matrix savings) is one method that can be used to assist in solving the problem of determining the delivery route. In this method the matrix are saving procedure used to sort consumers, there are nearest neighbor, farthest insert, and nearest insert. Based on those three procedures, founded that nearest neighbor provide shortest distance in shipping routes for each vehicle owned by the company to deliver goods to consumers.