Authors :
Dajah Vincent; Victoria Oyekunle
Volume/Issue :
Volume 8 - 2023, Issue 1 - January
Google Scholar :
https://bit.ly/3IIfn9N
Scribd :
https://bit.ly/3DwaLDO
DOI :
https://doi.org/10.5281/zenodo.7599097
Abstract :
This study offers a review of the shortest-path
problem-solving algorithms in fleet management system.
In a graph, the shortest path problem can be solved
using a variety of algorithmic approaches,and there are
significant variations between them. It is quite
challenging to find both the shortest or fastest path of
the optimal route, which takes the least amount of time,
as well as the shortest path on the graph with all of its
benefits and drawbacks. The algorithm must be able to
draw conclusions based on additional characteristics,
such as the length of each point's distance, the state of
the path between points, and the volume of traffic at
each point, in order to determine which is the most
effective.
This study offers a review of the shortest-path
problem-solving algorithms in fleet management system.
In a graph, the shortest path problem can be solved
using a variety of algorithmic approaches,and there are
significant variations between them. It is quite
challenging to find both the shortest or fastest path of
the optimal route, which takes the least amount of time,
as well as the shortest path on the graph with all of its
benefits and drawbacks. The algorithm must be able to
draw conclusions based on additional characteristics,
such as the length of each point's distance, the state of
the path between points, and the volume of traffic at
each point, in order to determine which is the most
effective.
