The trade-off between minimising route distance and reducing the risk of delayed parcels!

The trade-off between minimising route distance and reducing the risk of delayed parcels!

ROUTE OPTIMISATION · OPERATIONAL RESILIENCE

The hidden trade-off between route efficiency and operational resilience

Minimising distance and travel time matters. But for long delivery routes,
another question can become just as important:
which deliveries should we complete first?

01 — THE TRADITIONAL OPTIMISATION PROBLEM

Most optimisation starts with three questions

In route optimisation, we usually ask questions such as:

01
How can we minimise total distance?
02
How can we minimise travel time?
03
How can we complete the route as efficiently as possible?

These are fundamental objectives in solving TSP, VRP and other multi-stop
routing problems.

But in real logistics operations, there is another consideration that becomes
increasingly important as routes become longer:

THE OTHER QUESTION
Which deliveries should we complete first?

That is particularly important for long last-mile routes, where a small
routing decision early in the shift can determine how many customers are
affected several hours later.

For a route starting from a depot or terminal, it may feel natural to serve
nearby stops first and progressively move towards more distant areas.

Interestingly, that sequence is not always the mathematically shortest or
fastest route.

In some cases, an optimiser can reduce total distance by travelling towards
a more distant cluster early, returning through another area later, or
following a sequence that does not simply progress from the closest deliveries
to the farthest ones.

Mathematically, that may be the better solution.

Operationally, however, there is another side to the problem.

What happens when the day does not go according to plan?

02 — REAL-WORLD UNCERTAINTY

What happens when the day does not go according to plan?

A route plan assumes that the operation will progress approximately as expected.
But real delivery operations contain uncertainty.

🚦 A serious traffic jam may appear.
⛔ A road may suddenly close.
🚚 A vehicle may have a problem.
⚠️ An accident may delay the driver.
🌧️ Weather conditions may deteriorate.
⏱️ Service times may become longer than expected.

When something unexpected happens late in a long route, the important question
is not only:

TRADITIONAL KPI
How many kilometres have we driven?
OPERATIONAL EXPOSURE
How many customer orders are still waiting to be delivered?

This creates an interesting trade-off in route optimisation.

A route that prioritises nearby stops earlier may be slightly longer overall,
but it can complete a larger number of deliveries earlier in the shift.

If a major disruption then occurs, fewer customer orders remain exposed to
the delay.

03 — A SIMPLE EXAMPLE

60 stops. Two valid routes. Two very different outcomes.


Consider an illustrative route containing 60 delivery stops.

Most of the stops are relatively close to the terminal, while a smaller group
is located farther away.

ROUTE A

Minimum-distance solution

The optimiser finds that the shortest overall sequence is to move towards one
of the more distant areas relatively early, connect several geographical clusters
efficiently, and eventually return through some of the areas closer to the terminal.

Total distance
72 km
Delivered halfway
32 / 60

ROUTE B

Progressive service solution

The second route deliberately gives more preference to serving nearby and dense
groups of deliveries first, before gradually progressing towards the more distant stops.

Total distance
74 km
Delivered halfway
42 / 60

Deliveries completed after half of the shift
Route A
32 of 60
Route B
42 of 60

NOW INTRODUCE A DISRUPTION
A major accident causes significant traffic disruption during the second half
of the shift.
ROUTE A
28
orders still waiting
ROUTE B
18
orders still waiting

35%

fewer parcels remain exposed to the disruption in this illustrative scenario.

28 pending orders → 18 pending orders

The second route travelled slightly farther, but significantly fewer customers
are exposed to the disruption.

The numbers above are only an illustrative example, but the operational
trade-off is very real.

Then how to solve this multi-objective complex problem efficiently?
Then how to solve this multi-objective complex problem efficiently?
04 — MULTI-OBJECTIVE OPTIMISATION

So what is actually the “best” route?

This is why defining the ”best route” is more difficult than simply minimising
distance or duration.

The optimiser may need to balance two objectives:

01
EFFICIENCY
Minimise total route distance and duration
BALANCED AGAINST
02
ROBUSTNESS
Maximise the number of orders completed earlier in the route

These objectives can sometimes conflict.

Giving too much weight to early completion could create inefficient routes with
unnecessary additional kilometres.

Giving no weight to it at all may create mathematically excellent routes that
expose a larger number of deliveries to late-shift operational uncertainty.

The right answer therefore does not have to be one extreme or the other.

05 — WHY ROUTE LENGTH MATTERS

The longer the route, the more uncertainty matters

For a route with 10 or 15 stops, this consideration may have relatively little impact.

But the situation changes when a courier is expected to visit 50, 60, 80 or more
stops during one shift.


10 stops


15 stops


50 stops


60 stops


80+ stops

DISRUPTION AFTER
1 hour
DISRUPTION AFTER
6 hours

The longer the route, the greater the exposure to uncertainty throughout the day.

06 — THE CONTROLLED TRADE-OFF

Then how do we solve this efficiently?

THE KEY PRINCIPLE
Allow a small increase in theoretical route cost when it creates a meaningful
improvement in operational robustness.

The goal is not to enforce a rigid rule saying that the closest stop must always
be visited first or that the farthest stop must always be last.

That would itself produce poor solutions in many routing problems.

Instead, the optimisation process can consider the operational benefit of
progressively completing deliveries while still protecting overall route efficiency.

07 — TRENDROUTE.AI

How we reflect this philosophy in our optimisation engine

The goal is not to replace mathematical optimisation with a collection of rigid
operational rules.

Instead, this philosophy is reflected in several other aspects of TrendRoute.ai:

Route-shape quality
Looking beyond distance alone to evaluate the quality of the route structure.
Less zig-zagging
Reducing unnecessary backtracking and repeated movement between areas.
Geographical progression
Considering how a route progresses naturally through delivery areas.
ETA prediction
Combining geographical and operational intelligence around the mathematical optimiser.

THE BROADER PRINCIPLE
A strong route optimisation engine should not optimise only for the
best route on paper.
It should optimise for a route that performs well when the real world does not
behave exactly as planned.