Industries / Transport and vehicles / Trucking and freight
Dispatch and routing
Dispatch is the office work of deciding which truck takes which load, in what order it makes its stops, and where it is while on the road.
6
Milestones achieved, from 1959 to 2022.
1
To watch for: announced, not yet confirmed outside.
2
Open deliverables. Nobody has shipped them.
The road
AchievedWatch forOpen
Achieved
1959
Routing becomes a math problem
George Dantzig of the RAND Corporation and John Ramser of the Atlantic Refining Company set out how to route a fleet of gasoline trucks from a bulk terminal to many service stations so the fleet drives the fewest miles. Their "truck dispatching problem" is the start of what researchers now call the vehicle routing problem.
LessonThe authors had worked trial problems by hand and said no practical applications had yet been made; routing at scale had to wait for computers.
Credit
G. B. Dantzig and J. H. Ramser, Management Science 6(1)
1964
A quick rule for routes
G. Clarke and J. W. Wright published a method that joins delivery stops into routes by "savings," the miles saved by serving two stops on one trip instead of two. It runs fast on a computer, or even by hand, and gave dispatchers a usable answer for many trucks leaving one depot.
Credit
G. Clarke and J. W. Wright, Operations Research 12(4)
1988
Satellite messages reach the cab
Qualcomm launched OmniTRACS in August 1988, a satellite data link that let a fleet office track its trucks and swap messages with drivers anywhere on the road. Schneider National placed the first major order that year.
Credit
Qualcomm; Schneider National
2000
Full GPS accuracy for civilians
The US military had been degrading civilian GPS signals on purpose, a feature called Selective Availability. On the president's order it was switched off just after midnight at the end of May 1, 2000, and civilian receivers got positions within about 10 to 20 meters, close enough to follow a truck street by street.
LessonAn industry can build on a public signal once its owner commits to it; the US government says it has no intent to use the feature again.
Credit
US Department of Defense, at President Bill Clinton's direction
2016
Route software at fleet scale
UPS won the Franz Edelman Award, the main prize for applied operations research, for ORION, software that plans the order of stops for each delivery driver. By December 2015, 35,000 of UPS's 55,000 US drivers used it; UPS reported more than $320 million saved and estimated 10 million gallons of fuel saved a year at full use. The work took more than ten years.
Credit
UPS; award by INFORMS
2022
Shared tests and free solvers
The 12th DIMACS Implementation Challenge at Rutgers University drew 60 registered teams to compare routing programs on eight problem types, including routes with delivery time windows, and held its workshop in April 2022. The method that ranked first on the time-window problem was released as PyVRP, a free, open-source Python package.
LessonShared test problems let anyone check which routing method works best, without relying on a vendor's word.
Credit
DIMACS at Rutgers University; Niels Wouda, Leon Lan and Wouter Kool (PyVRP)
Watch for
Software that picks the driver
PCS Software says its Cortex Dispatch Manager suggests which driver should take each load, weighing location, hours left to drive and past assignments, and learns when a dispatcher overrides it. It had been in a beta test with customers since March 2025, and no measured results were published.
Achieved whena fleet or an outside party publishes measured before-and-after results, such as dispatcher time per load or empty miles.
Claimed by
PCS Software, September 2025
Open
01
Find the unmapped low bridges
An open tool that takes a truck route and the truck's height and flags every bridge on the route whose height is missing from OpenStreetMap or too low. Test it on the railway bridges that trucks hit most often in Britain, and publish how many lack correct height data.
The briefCredit · unclaimed02
Truck rules in routing tests
A public set of routing test problems on real road networks that include truck rules: low bridges, weight limits, delivery time windows and required driver breaks. Publish how PyVRP and other free solvers do on them, and how often a route planned without the rules breaks one.
The briefCredit · unclaimed
Open 01 · the brief
Find the unmapped low bridges
The first to publish is credited on this line, and the deliverable moves from Open to Achieved.
What to build
An open tool that takes a truck route and the truck's height and flags every bridge on the route whose height is missing from OpenStreetMap or too low. Test it on the railway bridges that trucks hit most often in Britain, and publish how many lack correct height data.
Why it is still open
Network Rail counted 1,706 bridge strikes from April 2025 to March 2026, at about £13,000 each, and in its survey 52% of truck drivers admitted they do not take low bridges into account. OpenStreetMap volunteers track UK bridge heights rail line by rail line, with some lines still to survey, and give no coverage figure. This research found no audit that compares map height data with where strikes happen.
Built with what exists
OpenStreetMap data and the Overpass query service; an open router with a truck profile, such as GraphHopper or OSRM; Network Rail's published list of its ten most-struck bridges; Python.
First step
Query OpenStreetMap for rail bridges over roads in Cambridgeshire, home to two of the three most-struck bridges in 2025–26, and count how many carry a height.
Done looks like
Every bridge on Network Rail's top-ten list, and at least 200 other rail bridges over roads in one region, marked as having a correct, wrong or missing height in OpenStreetMap, checked against the posted height signs, with the results published.
Open 02 · the brief
Truck rules in routing tests
The first to publish is credited on this line, and the deliverable moves from Open to Achieved.
What to build
A public set of routing test problems on real road networks that include truck rules: low bridges, weight limits, delivery time windows and required driver breaks. Publish how PyVRP and other free solvers do on them, and how often a route planned without the rules breaks one.
Why it is still open
The DIMACS challenge's eight problem types cover capacity, time windows, split deliveries, electric vehicles and more, but none includes road restrictions for trucks. A search for public test sets on real road networks found none that encode truck height or weight limits.
Built with what exists
OpenStreetMap height and weight data; GraphHopper or OSRM for travel times; PyVRP, VROOM or Google OR-Tools as solvers; the CVRPLIB file format for sharing problems.
First step
Build one problem with 30 delivery stops in one city, solve it once with car travel times and once with truck-legal travel times, and count how many low bridges and weight-limited roads the first route uses.
Done looks like
At least 50 test problems on the road networks of at least three cities, each with a checker that flags rule violations, and a published results table for at least three free solvers.