Q-Logos
Route Planner vs Route Optimization Software: Which One Does Your Operation Need?
A route planner sequences one vehicle's stops. Route optimization software assigns stops across many vehicles under capacities, time windows and driver hours. Learn the difference, the questions that tell you which you need, and where a simple planner stops being enough.
Two kinds of software that share a search term
Search for routing software and you will find two different kinds of tool described with the same words. One takes a list of stops and tells you what order to visit them in. The other takes a day's worth of orders, a set of vehicles and a rulebook, and decides who goes where, when, and in what order. Both get called route planners and both get called route optimization software.
This page separates the two, explains what each one is actually solving, and gives you a short set of questions to decide which problem you have. It does not rank products. The right choice depends on the shape of your work, not on a feature count.
What a route planner solves
A route planner answers one question: given these stops, in what order should one vehicle visit them? You supply a start point and a list of destinations. The planner searches for a visiting order that keeps the total distance or estimated time short, and shows it on a map.
That is a sequencing problem, close to the classic travelling salesman problem. It is harder than it looks: the number of possible orders grows explosively as stops are added, so beyond a small list nobody checks every order. Planners use heuristics such as nearest-neighbour construction, 2-opt improvement or simulated annealing to find a good order quickly without proving it is the shortest one. The page on how a multi-stop route planner works walks through those methods.
What a planner takes for granted is just as important as what it computes:
- One vehicle. The whole list belongs to one trip.
- The list is already decided. Someone else chose which stops are on it.
- No clock constraints. Any stop can be visited at any point in the trip.
- No load limit. The vehicle can carry everything for every stop.
- Planned once. The order is worked out before the trip starts.
What route optimization software solves
Route optimization suites start where a planner's assumptions end. The core problem is usually called the vehicle routing problem, and the commercial versions add layers on top of it:
- Many vehicles. The software decides which vehicle serves which stop. This assignment is often the hardest and most valuable part.
- Capacity. Each vehicle can carry only so much weight, volume or number of parcels, so stops have to be divided to fit.
- Time windows. A customer is promised a delivery slot, a business only receives goods in the morning, a pickup must happen after a certain hour. Orders that break a window are not acceptable, even if they are shorter.
- Driver hours and breaks. Shift lengths, legal rest rules and start and end locations limit what each driver can do.
- Depots and multiple trips. Vehicles may reload at a depot and run more than one loop in a day.
- Live re-planning. New orders, cancellations, a vehicle breakdown or a closed road change the plan during the day, and the software redistributes work.
- Road-network distances and traffic data. Because time windows depend on real arrival times, these systems generally need drivable distances and some model of traffic rather than straight-line estimates.
Each layer turns a sequencing problem into an assignment and scheduling problem with many sequencing problems inside it. That is why such suites are larger, need more setup (vehicle profiles, service times, shift data), and are usually priced and evaluated as operational systems rather than as a quick tool.
Questions that tell you which one you need
Work through these with your actual operation in mind:
1. How many vehicles share the work on a typical day? One means a planner fits. Several, with the split not obvious, points to optimization.
2. Who decides which stops go to which driver? If you do it by hand and are happy with that, a planner can order each driver's list. If deciding the split is the painful part, a planner will not help with it.
3. Do stops have promised times? Appointment slots and opening hours are time windows. A planner that does not model them can produce an order that is short and still unusable.
4. Is load a limit? If vehicles fill up before the list is done, you need capacity modelling.
5. Do you re-plan during the day? Dispatch that reacts to new orders and delays is an optimization-suite feature.
6. How far do you need to trust arrival times? If an estimate is enough to sequence stops, a planner's modelled times may do. If a customer is quoted an arrival time, you need road distances, traffic data and service times built in.
If most of your answers are "one vehicle, no fixed times, no load limit, planned before leaving", a planner is the proportionate tool. If several answers land on the other side, a planner will leave the hard parts to you.
The middle ground: a planner per driver
Plenty of small operations sit in between. A common pattern is to split stops by area or by habit, then run each driver's list through a planner. This is reasonable when the split is natural and stable, and it keeps setup light.
Know its limits. The planner only optimizes within each list; it cannot notice that moving two stops from one driver to another would shorten both days. And it still ignores whatever it does not model, so if a stop has a fixed slot, you have to protect that slot yourself, for example by checking the suggested order and adjusting it.
Where Q-Logos sits
Q-Logos is on the planner side for the web route page, and it is useful to be exact about what that means.
One stop list, one ordering problem. You enter stops on the route page and press optimize. The server orders that single list with classical simulated annealing. The backend labels its engine quantum-inspired, but it runs on ordinary servers with no quantum circuit or quantum hardware. The page on simulated annealing for route ordering explains how the search works.
Three alternatives to compare. Each request returns three alternative orderings, shown as three cards and drawn on the map. Per the server's own variant note, they are three independent simulated-annealing runs of the same distance objective, not three different goals, so treat them as options to compare by eye. Under the results the page prints the method notes the server sends, including the baseline it compares against: a nearest-neighbour order improved by 2-opt.
Straight-line distance. The ordering and the reported distance both use straight-line (haversine) distance between stops, and each route card labels it as straight-line, not road distance. Durations are modelled estimates from that distance. The page on straight-line vs road distance explains when that is a reasonable first pass and when it misleads.
What it does not model. The route optimizer does not split stops across vehicles, does not model vehicle capacity, and does not model deadlines, time windows or driver hours. If a request carries a vehicle count or a per-stop deadline, the server lists those inputs back as not modelled rather than pretending to use them. There is no road network and no live traffic feed. You can choose a traffic level, and the current weather at your first stop may be applied; these scale estimated travel time by a fixed planning rule and do not change the stop order when applied route-wide. Arrival-time figures, including the ETA percentiles shown under the results, come from a synthetic model, not measured trips.
So if your day is one vehicle and one list, Q-Logos is built for that problem. If your day needs work split across a fleet under capacities and promised times, that is a vehicle routing problem, and the Q-Logos route page will not solve it for you.
A short checklist
- Count vehicles and ask who decides the split. That single answer often settles the question.
- List every rule a valid route must obey: time slots, load, shift length, depot returns.
- Check whether a tool models each rule, or merely accepts the field and ignores it.
- Check which distance it uses and whether arrival times are modelled or measured.
- Pick the smallest tool that respects every rule you cannot break.
Plans differ in how many routes you can run and how many stops a route can hold; the limits are on the pricing page. If one list and one visiting order describe your problem, create a free account and try it on your own stops.
If your problem is one list of stops and one visiting order, create a free Q-Logos account, enter your stops and compare the three alternative orderings it returns.
Get started