01

One plan, competing objectives

A business may minimise distance, time, vehicles, lateness or cost. Define priorities and constraints that the solution may not breach.

Separate hard constraints such as capacity from preferences. Otherwise a mathematically efficient route may be impossible to operate.

02

Inputs determine the result

Addresses must geocode correctly, service times must be realistic and vehicle and driver availability must be current. Segment historical observations by location type, weekday and season.

  • address and coordinates;
  • time window and priority;
  • weight, volume and load requirements;
  • vehicle capacity and attributes;
  • working time, breaks and driver base;
  • traffic events and unavailability.

03

Dynamic replanning

Delays, cancellations, new jobs and failures occur during the day. Define when the system may replan and which changes require dispatcher approval.

Continuous optimisation can create instability. Plan consistency and clear communication are important measures alongside distance.

04

Pilot measures

Compare distance, duration, stops, on-time performance, failed jobs and manual effort across similar days and volumes.

Record every manual change. It reveals missing constraints, incorrect data and cases where dispatcher knowledge outperforms the current model.

SOURCES

Verified source material

Information was checked on the publication date. Legal obligations should always be assessed for the specific organisation and use case.

  1. ENISA — cyberzagrożenia w transporcie
  2. GS1 — standard EPCIS dla widoczności łańcucha dostaw