Automatically assign consignments to vehicles with a built-in VRP solver, and preview the result before committing.
Stop spending hours building route plans manually. Transportial's built-in Vehicle Routing Problem (VRP) solver analyses every open consignment, every available vehicle, driver capacity, time windows, and EU driving regulation constraints, then produces an optimised plan in seconds.
The solver takes every unplanned consignment with its time windows, quantities and requirements, plus the vehicles and drivers you make available to it.
Choose which vehicles, depots and time windows the solver may use. Pin assignments that must not change — a dedicated customer vehicle, a pre-agreed pickup — and it optimises around them.
The engine builds an initial plan with nearest-neighbour construction, then improves it with 2-opt and Or-opt passes to cut total distance and time, checking capacity, time windows and EU driving rules throughout.
The proposed plan appears on the Plan Board and map as a preview. Inspect it trip by trip, adjust anything by hand, and only then commit it to the live plan.
When new consignments arrive mid-day, the solver calculates the cheapest insertion point in trips that are already running, without reshuffling stops that drivers are en route to.
The VRP solver runs as a dedicated Routing Engine backend mode, independently scalable from the API and Worker nodes. It accepts requests via an internal queue backed by Apache Kafka.
Yes. EU Regulation 561/2006 driving and rest constraints are hard constraints inside the solver. Plans that would violate them are never proposed, and required breaks are part of the calculated schedule.
Yes. Optimisation runs in preview mode: the proposed plan appears on the Plan Board and map, where you can inspect it, adjust trips manually, and only then commit. Nothing changes in the live plan until you confirm.
Yes. Pinned assignments — a dedicated vehicle for a customer, an agreed pickup slot — are treated as fixed, and the solver optimises the remaining work around them.
The solver supports dynamic insertion: it calculates the cheapest feasible insertion point in trips that are already active, without disturbing stops drivers are currently heading to.
Total distance and time across the fleet, within hard constraints: vehicle capacity, time windows, equipment requirements and EU driving rules. Fewer kilometres with the same delivery performance is the practical outcome.
View all features
Start free with full platform access, or talk to our team about your specific operation.