Performance
High performance methods deliver results within seconds
Variety of TSP Solver
High flexibility in solving traveling salesman problems caused by manyfold restrictions
Define parts of sequence in advance
Determine the exact position of special transports in a route.
The solution for the traveling salesman problem (TSP)
The Sequence Optimization API is able to calculate even the most complicated routes such as round trips, open trips or depot-free trips, with depot-related or AB-orders, pickups and deliveries, time windows or multiple depot locations.
Use a light-weight API to solve exactly and only your task
You don't need a fully comprehensive software solution. What you need is a specialized tool that quickly, reliably and easily calculates the best sequence for your hundreds of transports.
Take account of traffic patterns and constructions
Dynamically optimize your route by using not only static traffic data, but also traffic patterns, such as rush hours, and information about ongoing construction work.
Include time restrictions and legal regulations in the planning
Consider internal or legal working regulations regarding break and rest times for your drivers and factor them into your sequence planning. You can also consider additional time restrictions such as opening hours of depot locations and ramps or preferred delivery times.
Flexibly change the route thanks to live dispatching
In case something unforeseen happens, like an accident on the route, a cancelled transport, or a last-minute order, the Sequence Optimization API enables the dispatcher to intervene manually and helps him to quickly find the best solution for the problem.
