Product

AI-Powered Trip Optimisation

Automatically assign consignments to vehicles with a built-in VRP solver, and preview the result before committing.

VRP2-optOr-optEU 561/2006Preview modeKafka
VRP
Solver built-in
2-opt
Improvement algorithm
EU 561
Regulation compliant
Preview
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.

Key highlights

  • Automatic assignment: Consignments are automatically assigned to vehicles and drivers based on capacity, time windows, vehicle type, and EU driving hour rules, without manual guesswork.
  • Best-in-class algorithms: The solver uses nearest-neighbour construction to build an initial plan, then applies 2-opt and Or-opt improvement passes to minimise total distance and time.
  • EU Regulation 561/2006 compliance: Driving and rest time constraints are built into the solver. Every generated plan is automatically checked against EU rules.
  • Preview mode: Run the optimiser in preview mode first. Inspect the proposed plan on the Plan Board and map view before confirming.
  • Dynamic insertion: New consignments that arrive mid-day can be inserted into existing active trips without disrupting other planned stops.
  • Configurable constraints: Control which vehicles, depots, and time windows the solver considers. Pin certain assignments and let the solver optimise around them.
Technical details

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.

Ready to put this to work?

Start free with full platform access, or talk to our team about your specific operation.