How Dolphin solve the VRP?
The VRP (vehicle routing problem) concerns the service of a delivery company.
How things and people are delivered from one or more depots which has a given set of home vehicles and operated by a set of drivers who can move on a given road network to a set of customers.
It asks for a determination of a set of routes, (one route for each vehicle that must start and finish at its own depot) such that all customers’ requirements and operational constraints are satisfied and the global transportation cost is minimized. Th Vehicle routing planning cost may be monetary, distance or otherwise. Of course, the minimizing the length of the route is the most significant factor.
The data, which Dolphin system needs to minimize the length of longest route, are
• Length of distance between locations
• The number of vehicle
• The number of locations
• The location where all vehicle start and end
• A long with the pairs of pickup and deliver location
Dolphin system uses VRP (vehicle routing problem) algorithm with data above then optimal the fleet distribution in order to cost reduction.
