Skip to content
AIRO

Route optimization options: the complete guide

AIRO turns a list of orders and vehicles into routes. Most plans need no option at all: the defaults give the shortest plan that respects capacities, time windows and shifts. This guide explains every option, what it changes in the plan, what it costs in distance, and when it is worth turning on.

How the engine works

  • Your file is read and validated row by row: addresses, quantities, time windows. Problems are reported before anything is optimized, with the row and what to fix.
  • Addresses are located (geocoded). Then real road distances and drive times are measured between the places in the plan.
  • A deterministic solver (Google OR-Tools) searches for the best routes within a time limit of a few seconds. No AI model computes or changes your routes; Claude and ChatGPT only call the engine through the connector.
  • Every order that cannot be served is listed as unassigned, with the reason and what to change. Nothing is silently dropped.

All options at a glance

OptionWhat it doesEffect on the planDefault
ObjectiveMinimize kilometres or driving timeDuration favours faster roads, sometimes longer onesFewest kilometres
Vehicles to useAs many as is cheapest, all of them, or as few as possibleFewest = fuller vehicles, longer days; all = shorter days, more distanceAs many as is cheapest
Balance the workEven working time, stop count or load across vehiclesFairer days; usually some extra distanceOff
Capacity, weight, volumeVehicle limits in load units, weight and volumeOrders are split across vehicles so no limit is exceededCapacity required; weight and volume optional
Time windowsEarliest and latest arrival per stopRoutes are ordered around appointments; can need more vehiclesNone
Service timeMinutes spent at each stopLonger days; fewer stops per vehicle5 minutes
ShiftsWhen each vehicle can workRoutes fit inside the shift08:00–18:00
BreaksOne break per driver, inside a windowBreak placed where it costs leastNone
SkillsEquipment or certifications an order needsOnly matching vehicles take the orderNone
PriorityHigh, normal or lowWhen everything cannot fit, low goes first and high is keptNormal
Route limitsMax hours, km or stops per routeShorter routes; can leave orders unassignedNone
Start and end per vehicleEach vehicle leaves from and returns to its own placeMulti-depot plans; drivers starting from homeThe depot
Open routesRoutes end at the last stopNo return leg: less distance and timeOff
Pickup and deliveryCollect at one address, deliver to anotherSame vehicle does both, pickup firstOff (loaded at the start)
Assigned vehicleLock an order to a vehicleThe engine only orders that vehicle's stopsEngine chooses
Typical trafficDrive times at the departure time, rush hours includedMore realistic arrival times; higher priceOff
Work typeDeliveries (goods on board) or service visitsDecides how a day is re-planned: hand over loads, or spread visitsDeliveries
Re-plan the rest of the dayNew plan from a time of day, vehicles where they areAbsorbs breakdowns, late orders and early finishesOn demand

Choosing options in three steps

  • Start with no option. Run the plan and compare it with your current routes (the baseline comparison is free). That is the cheapest plan that respects your data.
  • Add the hard rules of your business: time windows, skills, weight limits, breaks, route limits. Each one makes the plan more realistic and can add distance or vehicles.
  • Then add preferences: balance the work, use every vehicle or as few as possible, typical traffic. Compare plans side by side before you send them to drivers.

Each guide page covers one family of options: /docs/optimization/goals, /docs/optimization/constraints, /docs/optimization/routes, /docs/optimization/dispatch and /docs/optimization/travel-times. /docs/optimization/industries gives ready-made setups by industry, and /docs/optimization/spreadsheet-columns lists every column the import understands.