Route Optimization

Route Optimization

This workflow integrates warehouse and production facility locations to determine the optimal route from a selected production site to all warehouses. Its objective is to solve the Travelling Salesman Problem (TSP), which seeks the shortest possible route that visits each warehouse at least once and returns to the starting point.

The workflow computes distances and travel times for all origin–destination pairs and converts these into user-friendly units such as kilometers and hours. It then allows to choose between two optimization strategies—Nearest Neighbor or Mixed-Integer Linear Programming—to identify the best routes. The resulting optimal routs and locations are visualized in an interactive dashboard featuring geomaps and network graphs.

Data Reading

Compute location geometry and distance/route matrix

View Optimal Route