Optimization of Distribution Route Using Dijkstra‟s Based Greedy Algorithm: Case of Retail Chain

Abstract

In cities, the efficiency of resolving pickup and delivery routes is dependent on calculating the shortest routes among shops in a complicated road network directly. Selecting the best path is a practical problem with a high frequency of application in everyday life, and it has practical implications for the research. One of the most well-known optimal path selection methods is the Dijkstra's based greedy Algorithm. In actuality, there exist numerous models for route selection; however, the main focus of this study is on the implementation of one of them, shortest path algorithms for distribution routing optimization. When solving the optimal path problem, it also serves as the theoretical foundation for many empirical models. Many factors will affect your decision on the best path to choose. In practise, the selection conditions will frequently contain many precedence conditions and will entirely pick the influence path. The optimization algorithm is implemented and confirmed in this paper through analysis and actual application.

A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots

“…Dijkstra's algorithm is an algorithm for finding the shortest paths between the nodes in a graph (Dijkstra's Algorithm, 2021;Iscan & Tuncel, 2022). Dijkstra is a breadth-first-search (BFS) algorithm for finding the shortest paths from a single source vertex to all other vertices, and it is able to produce the shortest route (Fadzli et al, 2015;Kumar & Gao, 2021).…”

“…When Dijkstra's Algorithm is compared with the other weighted algorithms, it can be seen that it is one of the simplest implementable algorithms (Kumar & Gao, 2021). Also, it has a flexible structure and can be modified conveniently to find the most available path on the map.…”