Shortest path problems are encountered in many engineering applications, eg, intelligent
transportation, robot path planning, and smart logistics. The environmental changes as …

The purpose of shortest route algorithms is to find a path having fewest weights between any
two vertices along the edges. However, the shortest path problem may take many different …

This paper seeks to investigate the performance of two different dynamic programming
approaches for shortest path problem of transportation road network in different context …

The A*(A-Star) algorithm is a direct search method for solving the shortest path in a static
road network. Because of its robust search ability and guaranteed path optimality, it has …

Roads play a Major role to the people live in various states, cities, town and villages, from
each and every day they travel to work, to schools, to business meetings, and to transport …

In this paper, we propose an improved walk search strategy to solve the constrained shortest
path problem. The proposed search strategy is a local search algorithm which explores a …

Shortest path problem is a typical routing optimization problem that is generally involved
with a multi-criteria decision-making process. Therefore, the main objective of this paper is to …

Roads are essential for the daily mobility of residents in various locations to work, education,
and other destinations as well as for the transportation of their commodities. Roads continue …

The Dijkstra algorithm is a common method used when solving shortest path problems. It is
a graph-based method that compares node distances, selects the shortest subsequent …

Several shortest path algorithms have been suggested by the researchers and Dijkstra's
shortest path algorithm is the most appropriate one when there is a single source-single …