Routing & transportation

Better routes. Better use of every vehicle

4colors plans routes around service commitments, capacity, cost and timing. Its algorithms make better use of every vehicle and resource you have.

Airbus x BMW challenge winner for integrated production and transportation planning.

Explore vehicle routingDiscuss a transportation challenge

Shortest doesn't always mean best

Two customers may be close together but have incompatible delivery windows. A vehicle may save distance on a proposed route yet exceed its carrying capacity. A route may look efficient until a loading constraint makes the trip impossible.

Transportation optimization finds useful combinations of assignments, routes and schedules under the rules that make a plan operational.

The example plans the same vans and stops twice: in the order received, then optimized. Only the sequence changes.

Two vans, twelve stops, one depot.

Distance driven412 km

Longest route5.2 h

Illustrative example, not customer data.

Vehicle choices, stop order and delivery commitments

  • Which vehicle serves which work

    Allocate deliveries, collections or movements among resources with different sizes, capabilities, operating limits and availability.

  • In what order, and when

    Choose stop sequences while respecting service windows, journey times, loading and unloading requirements, and schedules that may affect the rest of the operation.

  • How transportation connects to other decisions

    Coordinate routes with load composition, inventory readiness and production timing. A cheaper route can be expensive if the right goods aren't available or arrive too late.

How to use 4colors

From the solver engine to ready-made planning apps, pick the level that suits your team.

Evidence from difficult logistics problems

  • | Winner

    Airbus x BMW Quantum Computing Challenge

    Our Quantum-Powered Logistics entry addressed integrated production and transportation optimization.

In the ROADEF/EURO Renault challenge, an earlier generation of algorithms reached the final on an integrated loading and logistics problem.