History of Vehicle Routing Problem

Usually, the problem of optimizing routes for vehicles and mobile robot is classified into the Vehicle Routing Problem (VRP). The VRP is a type of combinatorial optimization and integer programming problem that asks, “What is the optimal set of routes for the vehicle(s) to traverse in order to deliver to a given set of customers?”. The VRP is first introduced by Dantin in 1959 which the first algorithmic approach was applied to solve the petrol deliveries problem.