The document discusses the basic vehicle routing problem (VRP). The VRP involves determining optimal routes for a fleet of vehicles to traverse in order to deliver or pick up goods from customers. The goal of the basic VRP is to minimize the total distance traveled or time required to service all customers using the fewest number of vehicles.
Basic VRP: Stems from tsp where sales people all leave from the same depot, visit customers (all customers are only seen by one sales person) and sales people return to the depot at end of the day. VRP: All customers need to be serviced by a homogenous fleet of vehicles.Real life:Depot working hoursCustomer delivery windowsHeterogeneous fleet of vehiclesVehicle capacity constraintsPrioritiesDifferent off loading times (fixed and variable)Maybe product-product exclusionsMaybe product vehicle exclusionsMultiple tripsSleep outs