Guide

Multi Stop Route Optimization:Stop-Order Arithmetic, Route Inputs, a Hand Method, Solver Methods, Planning Tools, AI Claims and a Louisville Technician Day

Multi stop route optimization: how fast stop orders multiply, the inputs, a hand method, solver methods, tools from Google to OR-Tools and a costed sample day.

By Published Updated

11 min read

Multi stop route optimization computes the order in which one vehicle visits a set of stops so that total drive time or distance is lowest, inside the day's constraints: a fixed start and end, customer time windows, time on site and the driver's hours. Route planning draws a line through stops in a given order; optimization chooses the order.

A day of stops entered in the order customers called is a route nobody chose. A technician crosses the river twice before lunch, arrives at a 10 a.m. window at 10:40, and finishes the day 22 miles longer than the same stops required. This guide belongs to FieldRanger's dispatching and scheduling guides, and the product side is on the route optimization software page. It explains why stop orders multiply, lists the inputs an optimization needs, sets out a hand method and the solver methods behind software, compares planning tools, examines AI claims and Lalamove's multi-stop orders, and closes with a costed Louisville day, a checklist and the software record.

Three terms recur. The travelling salesperson problem is the search for the shortest route through a set of points; the University of Waterloo's TSP pages call it "one of the most intensively studied problems in computational mathematics" (University of Waterloo, Traveling Salesman Problem, read November 13, 2026). A travel time matrix is the table of drive times between every pair of stops. A time window is the period in which a customer has agreed to the arrival.

Stop-order arithmetic for a multi-stop day

The number of possible orders grows faster than the number of stops. A route that leaves the shop, visits n stops and returns can visit them in n × (n − 1) × … × 1 orders, written n!. Eight stops have 40,320 orders; ten have 3,628,800; twelve have 479,001,600. Route4Me makes the same point in its own documentation: "Even with just 10 stops, millions of routing combinations are possible" (Route4Me, pickup and delivery route optimization).

Two consequences follow. A dispatcher cannot compare every order by eye beyond a handful of stops, so hand methods rely on rules that discard whole sets of orders without checking them. Software does the same thing faster: it builds a reasonable order, then improves it, and stops when a time limit is reached. Neither proves that the result is the shortest possible route, and neither needs to; the test is the drive time saved against the order the stops arrived in.

One vehicle and many vehicles are different problems. Ordering one technician's stops is the travelling salesperson problem. Deciding which of several technicians takes each stop is the vehicle routing problem, set out with fleet tools in best route optimization software. This guide stays with one vehicle's day.

Route inputs for an optimization

An optimizer can only respect what it is told. The inputs below decide whether its order can be driven.

Inputs to a multi-stop route optimization and where each comes from
InputWhat it holdsSource
Start and endShop, home or first job; where the day must finishThe dispatcher
Stop addressesEach stop as a mappable locationThe job record, geocoded
Travel time matrixDrive time between every pair of stops, by time of dayA map provider's traffic data
Time on siteMinutes at each stopCompleted jobs of the same type
Time windowsEarliest and latest arrival per stopThe booking
Fixed stopsA parts pickup first, a key collection lastThe dispatcher
Breaks and hoursLunch and the latest finishCompany policy and wage rules

Time on site matters as much as drive time. Two routes with equal miles reach the afternoon window at different hours when one front-loads the long jobs. A parts stop is an input too: with stock held at two sites, as in multi warehouse inventory management, the nearer warehouse holding the part becomes the route's fixed first stop. Delivery days add payload and driver-hour limits to the same list, as set out in delivery route planning.

Hand method for an eight-stop day

A dispatcher without software can still optimize a day of eight to ten stops with a fixed procedure:

  1. Place the stops with time windows first, in window order. They are the anchors the rest of the route must fit around.
  2. Group the remaining stops by area, using natural barriers such as rivers and highways as group boundaries.
  3. Choose a loop direction that reaches the earliest window on time, clockwise or counterclockwise from the shop.
  4. Insert each remaining stop at the position in the loop where it adds the least drive time.
  5. Walk the route forward with time on site added, and check every window.
  6. Where a window fails, move the anchor's group earlier or swap the loop direction, then check again.
  7. Verify: enter the final order in a map, compare its total drive time with the call order's total, and keep the shorter route only if every window holds.

Step 4 is the cheapest insertion rule. Step 3 replaces the habit of driving to the nearest stop next, which works until it strands the last stops on the far side of town.

Solver methods: construction, local search and time limits

Route software runs the same ideas at a scale no dispatcher can. Google's OR-Tools documentation lists first solution strategies, the method used to build an initial route (OR-Tools, routing options, read November 13, 2026). PATHCHEAPESTARC starts from the route's start node, connects it "to the node which produces the cheapest route segment", and extends from the last node added: the nearest-next rule. Insertion strategies build a route by inserting the cheapest node at its cheapest position, which is step 4 of the hand method.

Local search then improves the first route. The same OR-Tools page describes greedy descent as accepting improving neighbors "until a local minimum is reached", and guided local search as a method to escape local minima, "generally the most efficient metaheuristic for vehicle routing". Search limits terminate the solver after a set time or number of solutions, so the result is the best order found within the limit, not a certified optimum. The OR-Tools TSP guide shows the same pattern on a 13-city example built from a distance matrix.

The practical reading is that solvers differ in the constraints they accept and the time they are given, more than in the idea. A tool that cannot take time windows produces a short route that misses appointments.

Multi stop route planning and optimization tools

Planning tools fall into five classes, and they differ in who sets the order.

Multi stop route planning and optimization tools by class (vendor documentation read November 13, 2026)
Tool classWho sets the stop orderConstraint scope
Map app directionsThe driver, by dragging stopsStop count limit; no windows
Routes API with waypoint optimizationThe API, on requestUp to 25 intermediate waypoints; no via waypoints
Route Optimization API and OR-ToolsThe solverTime windows, capacity, driver hours, objectives
Route planner appsThe app's optimizerVaries by plan; stop caps on free tiers
Field service software with routingThe software, from scheduled jobsJobs, technicians and windows already on the schedule

Google's Routes API accepts "up to 25 intermediate waypoints", and requests with 11 to 25 are billed at a higher rate (Google, intermediate waypoints). Its waypoint optimization requires that no waypoint is marked as via, that the TRAFFICAWAREOPTIMAL preference is not used, and that optimizeWaypointOrder is set to true; such requests "are billed at a higher rate on the ComputeRoutes-Advanced SKU" (Google, optimize the order of stops). The Route Optimization API, by contrast, plans fleets "considering factors like time, cost, and vehicle capacity", with objectives such as on-time arrival and load balancing and constraints such as driver work hours (Google, Route Optimization API).

Stop caps, prices and free tiers for the consumer apps are compared in best route planner app, including the nine-stop limit and fixed order of Google Maps directions.

Multi-stop route optimization AI claims

Vendors describe route optimization as AI, and the term covers two different things. Ordering stops is combinatorial search: the construction rules, local search and time limits documented above. Predicting how long a leg will take at 4 p.m. is a forecasting task built on traffic data. A tool may use learned models for the second and classic search for the first, and a marketing page that says AI does not state which.

The documentation read for this guide describes heuristics, metaheuristics and constraints, and none of it depends on whether the method is called AI. The test for any tool, AI-labelled or not, is the same: total drive time and window misses for its sequence, against the order the stops were entered in, on a day the dispatcher already knows. A sequence produced by a chat assistant from a list of addresses passes the same test only when checked against a map's drive times.

Lalamove multi-stop orders and stop sequence

Lalamove is an on-demand delivery marketplace that books a driver for a customer's order, not a routing tool for a company's own vehicles. Its Philippines FAQ states that merchants can drop off goods "at up to 20 different locations within one booking", and that its API allows "up to 16 drop-off points and 1 pick-up point", with the warning that "the sequence in which you list the stops will be the route the driver adopts" (Lalamove Philippines, FAQ, read November 13, 2026). The same FAQ notes that drivers may deviate from the suggested route for traffic.

For a business sending a multi-stop Lalamove order, the optimization therefore happens before the booking: the customer orders the stops, with the hand method above or a routing tool, and the driver follows the list. Lalamove's United States pages returned no readable text when checked on November 13, 2026, so stop limits in other markets are read in the app itself.

Sample day: eight HVAC maintenance stops in Louisville

The technician and day are hypothetical: one HVAC technician in Louisville, Kentucky, with eight maintenance visits of one hour each, starting and ending at the shop. Stop C has an 8 to 10 a.m. window and stop F a 1 to 3 p.m. window. Miles and drive hours are samples. The wage is the BLS 2025 median for heating, air conditioning and refrigeration mechanics and installers in the Louisville/Jefferson County metro, $28.33 an hour, published by O\NET ([O\NET, Kentucky wages for 49-9021.00](https://www.onetonline.org/link/localwages/49-9021.00?st=KY)). Vehicle cost uses the IRS business rate of 76 cents a mile for July 1 to December 31, 2026 (IRS, standard mileage rates), both read November 13, 2026.

Sample Louisville day, call order and optimized order (sample miles and hours; published wage and mileage rate)
LineCall orderOptimized order
SequenceShop, A, B, C, D, E, F, G, H, ShopShop, C, A, B, E, F, D, H, G, Shop
Miles61.438.9
Drive hours2.41.5
Window resultC reached at 10:40, outside 8 to 10Both windows met
Vehicle cost at $0.76 a mile$46.66$29.56
Drive time at $28.33 an hour$67.99$42.50
Drive cost for the day$114.65$72.06

The saving is $42.59 a day. Over a sample 230 working days, that is $9,795.70 for one technician, before any extra visit the 0.9 recovered hours could hold.

The anchor set the order. Placing C first, because its window closes earliest, decided the loop direction; the remaining stops were inserted around it, and F's afternoon window then held with time to spare.

The day fits a map app and still needs a method. Eight visits and the return to the shop are nine stops, inside the limit of "up to 9 stops, which includes the final destination" in Google Maps directions (Google Maps Help, multiple stops), but the app keeps the order entered. The 22.5 miles were saved by the order, not by the map.

Multi stop route optimization checklist

  1. Start, end and fixed stops set for the day.
  2. Every stop geocoded from the job record.
  3. Time on site set per stop from completed jobs of the same type.
  4. Time windows recorded as earliest and latest arrival.
  5. Windowed stops placed first as anchors, then the loop direction chosen.
  6. Remaining stops inserted at their cheapest positions.
  7. The route walked forward with time on site, and every window checked.
  8. The tool's constraint scope matched to the day: windows, breaks and stop count.
  9. Verify: compare the optimized route's drive time and window misses with the call order's, and record the difference for the day.

Multi-stop days and auto-routing in FieldRanger

FieldRanger builds each technician's route for the day automatically. Multi-stop planning lays out a day of several job stops as one route, and route optimization sequences stops to cut drive time and fuel cost. Live traffic supplies real-time data for ETAs and route adjustments, distance and time estimates give job-to-job travel time and mileage, and dynamic rerouting adjusts routes when priorities change or jobs are added. Time window management sets arrival windows and tracks on-time performance, and route history shows past routes to improve the next ones.

The stops come from the schedule, not from a pasted list: a won HubSpot deal becomes a job with its context carried over, the drag-and-drop calendar assigns it, and turn-by-turn navigation guides the technician in the app. Plans are priced on pricing, and Start free trial gives 14 days without a card.

Frequently asked questions

What is multi stop route optimization?

The computation of the order in which one vehicle visits a set of stops so that total drive time or distance is lowest, inside fixed start and end points, time windows, time on site and the driver's hours.

How many possible routes are there for 10 stops?

A route that leaves a shop, visits 10 stops and returns has 3,628,800 possible visiting orders, which is 10 factorial. Eight stops have 40,320 and twelve have 479,001,600.

What are the main multi stop route planning and optimization tools?

Map app directions, where the driver sets the order; Google's Routes API with waypoint optimization, up to 25 intermediate waypoints; solvers such as the Route Optimization API and OR-Tools; route planner apps; and field service software that routes scheduled jobs.

Is multi-stop route optimization AI?

The ordering itself is combinatorial search: construction heuristics, local search and time limits. Some tools use learned models to predict travel times. The test for any tool is its drive time and window misses against the entered order.

Does Lalamove optimize multi-stop routes?

Lalamove's Philippines FAQ allows up to 20 locations in one booking and states that, for API orders, the sequence in which the stops are listed is the route the driver adopts. The order is set by the customer before booking.

How can a multi-stop route be optimized by hand?

Place windowed stops first, group the rest by area, choose a loop direction that meets the earliest window, insert each stop where it adds the least drive time, then check every window and compare the total with the call order.

Stop C's 10 a.m. window, placed first, did more for the Louisville day than any map: it fixed the loop, kept both appointments and took 22.5 miles off a route that held the same eight furnaces.

Run field service on HubSpot with FieldRanger

Estimates with e-signature, scheduling and dispatch, a technician mobile app and invoicing, synced to the HubSpot deals and contacts the business already keeps.

Book a demo