While traditional tracking solutions tell you ‘where your truck is’, our route optimization engine goes a step further to answer ‘where your truck should be!’

The classical Multi-Depot Vehicle Routing Problem (MDVRP) necessitates determining the routes for several vehicles from multiple depots to a set of customers and then return to the same depot. The route optimization engine helps in determining routes for vehicles to service all the customers at a minimal cost in terms of number of routes and total travel distance, without violating the capacity and travel time constraints of the vehicles. The customers are grouped based on distance to their nearest depots and then the vehicles are routed accordingly.

Usage Scenarios​

Simulated Annealing Algorithm​

Randomly generate a solution set of routes​
Generate new solution by disturbing the existing solution​
Compute the cost of old and new solutions​
Accept if the new solution is better, else accept with some probability​
Iterate previous steps till convergence criteria is met​

Meet Our Customers

Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo
Logo