The Need for Route Optimisation
In order to provide optimal routes for the planning requirements that our clients input, optimizer solves a problem called VRP.
What is VRP (Vehicle Routing Problem)?
The VRP is related to the operations of a supply chain and involves the transportation of goods from one or more depots using a specified set of vehicles operated by drivers who can travel on a particular road network to reach a group of customers. Its aim is to identify a set of routes, represented by S, for each vehicle that begins and ends at its designated depot while fulfilling all customer requirements and operational limitations, and minimizing overall transportation expenses, which can be monetary, distance-based, or of another nature.
The optimizer we have is capable of resolving various kinds of vehicle routing problems :
TSP (travelling salesman problem)
CVRP (capacitated VRP)
VRPTW (VRP with time windows)
MDHVRPTW (multi-depot heterogeneous vehicle VRPTW)
PDPTW (pickup-and-delivery problem with TW)
Shipsy’s Route Optimiser can solve any mix of the above problem types, thus helping organisations streamline their operations with ease.
Add Comment