Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm (original) (raw)
Related papers
Applying Dijkstra’s Algorithm in Routing Process
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.
Anapplication of Dijkstra's Algorithm to shortest route problem
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.
Identification of Optimum Shortest Path using Multipath Dijkstra’s Algorithm Approach
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.
Determining the Optimal Rice Distribution Route in Medan City Using Dijkstra's Algorithm
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.
Shortest Path Algorithms: Comparative Study and Analysis
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.
IJERT-A Study on Different Algorithms for Shortest Route Problem
International Journal of Engineering Research and Technology (IJERT), 2013
https://www.ijert.org/a-study-on-different-algorithms-for-shortest-route-problem https://www.ijert.org/research/a-study-on-different-algorithms-for-shortest-route-problem-IJERTV2IS90327.pdf Shortest path problems are among the most studied network flow optimization problems with interesting application across a range of fields. In this paper, three shortest path algorithms are discussed viz. Dijkstra's Algorithm (one to all pairs of nodes), Floyd Warshall's Algorithm (all to all pairs of nodes) and Linear Programming Problems (LPP). These algorithms are also solved using Matlab software, which gives quick results for larger nodes. This paper also deals with the methodology to find shortest distance using the dual of Linear Programming Problems. In addition, Complementary Slackness Theorem is discussed to solve the primal problem from the solution of dual problem and determine the shortest distance as well as shortest routes.
A Heuristic Graph-Based Shortest Path Algorithm for Optimizing Routing Problems
Route optimization is a process of considering all possible routes connecting the source and the destination and looks at the heuristic cost of each route and selecting the least cost route. Route planners depend principally on past occurrence of events associated with route optimization; hence they often use local knowledge, simple procedures, and ad hoc procedures to optimize the routes. In this paper, we proposed a graph-based shortest path algorithm for optimizing route directory. The algorithm is based on the Dijkstra algorithm. It is an improved shortest-path algorithm proposed as initially proposed by Dijkstra. In order to determine the shortest route and the most cost effective route, the algorithm is used to determine the shortest path that a traveler or someone going to a particular destination for the first time. The algorithm is tested by comparing its results with existing route algorithms and the results are presented and discussed.
Application of Graph Theory to Find Shortest Path of Transportation Problem
In this paper,we study on how graph theory can generate transportation problem using shortest path . we designed the solution for practical problem to find a shortest path between two points and graph search Dijkstra's algorithm .Also for the case ,We have developed a network model of the transportation problem which is analysed in detail to minimize shipment cost.
Procedia Computer Science, 2019
Nowadays, product distribution is extremely complex. The decision makers have many parameters to make an optimum decision. They avoid a receiving which is not on time. The aims to grant the best service. Mostly, the consideration parameters for decisionmaking are a cost and a distance. The parameters are used to obtain an optimal route distribution. Nevertheless, there are other parameters which have also the priority level such as congestion and risk. Absolutely, the parameters have the priority level for a decision maker. Therefore, the making decisions is increasingly difficult by reason of many parameters and its priority level. In this research, the various parameters will be created into a value to facilitate a making decision of a distribution optimal route. Giving the priority level of all parameters has been employed to solve the problem by vector normalized technique that is the bestnormalized technique of MCDM. The normalization is not only required to find the optimal route but also the system utilizes the priority level and Dijkstra algorithm which is the mostly method for the problem. Accordingly, the experimental result establishes that our system yielded high accuracy by considering all priority level of predetermined parameters.