Repository files navigation

In theVehicle Routing Problem (VRP), the goal is to find optimal routes for multiple vehicles visiting a set of locations. (When there's only one vehicle, it reduces to theTraveling Salesman Problem.)

But what do we mean by "optimal routes" for a VRP? One answer is the routes with the least total distance. However, if there are no other constraints, the optimal solution is to assign just one vehicle to visit all locations, and find a shortest route for that vehicle. This is essentially the same problem as the TSP.

A better way to define optimal routes is to minimize the length of the longest single route among all vehicles. This is the right definition if the goal is to complete all deliveries as soon as possible. The VRP example below finds optimal routes defined this way.

Source :Google

1. VRPTW with metaheuristics :https://github.com/donfaq/VRPTW

2. KTH Artificial Intelligence :https://github.com/OleguerCanal/KTH_vehicle-routing-problem

3. Vehicle-Routing-Optimization-Using-Artificial-Intelligence :https://github.com/desaichirayu/Vehicle-Routing-Optimization-Using-Artificial-Intelligence

4. Genetic-Algorithm-Based-Routing-Algorithm-for-Autonomous-Vehicles :https://github.com/Lirong-Zhang/Genetic-Algorithm-Based-Routing-Algorithm-for-Autonomous-Vehicles

5. Vehicle Routing Problem by Google :https://developers.google.com/optimization/routing/vrp

6. vehicle-routing-problem :https://github.com/jwang0306/vehicle-routing-problem

Thanks for Reading... If you have more resources to add. Please take pull and Submit...!!!