Route Planning Using Vehicles' Routing Algorithms

Abstract

The term "vehicle routing problem" (VRP) refers to optimization issues in the transportation, distribution, and logistics industries. They primarily concentrate on supplying a large number of customers with a variety of cars. Function of vehicle routing problem VRP is Determine the best path from a starting point to a road map destination using route planning tools. Because road traffic circumstances (e.g., congestion level, road incidents, etc.) can change during a car trip, the best route should be re-evaluated as soon as fresh traffic data becomes available. A significant difficulty for any transportation application is selecting an acceptable route planning method from the literature to use in real-world road networks. The Simulation of Urban Mobility (SUMO) package and TRACI were used to simulate the behaviour of these algorithms during runtime. The most well-known shortest route algorithm, Dijkstra, was the first SUMO algorithm to be implemented. We use TRACI to re-apply the algorithm and adapt a car's route in response to any changes in traffic conditions that affect the current best route. My goal is to replicate various algorithms and assess how well they perform based on the quality of the best route found.