With the rise in the economy and population of various developing and developed nations leads to an increase in the number of vehicles on the road to manifolds recently. In the smart vehicular networks, there are numerous vehicle transportation problems (VTP) exists. The main or the most common problem is the congestion occurrence due to traffic jams and road accidents, especially in urban areas. So route planning to find the optimal route for a vehicle that is moving from source to destination is an important and challenging task as the route conditions change with the traffic conditions, hence the shortest and optimal route needs to be re-evaluated. This manuscript presents a study and comparison of various pathfinding algorithms which include Dijkstra, A Star, CH, and Floyd Warshall algorithms which are available as optimal route finding algorithms. The simulation of working algorithms with comparison has been performed using SUMO with TRACI and using python coding. The simulation is performed on real maps of urban areas. The parameters used for the comparative study are travel time, distance travelled, and speeds of vehicles.