Tools
WareBeeTSP — Shortest Path.
Pick routes are travelling-salesman problems, and solving them properly beats any serpentine rule. WareBee's TSP engine finds the shortest path through every pick list on the twin's real navigation graph — aisle directions, access points and congestion included.
Book a demoTSP — Shortest Path
Solved routes, not walked rules.
True shortest path
TSP solvers running on the twin's navigation graph — not straight-line guesses.
The solver is free to reorder the stops themselves, not just find the fastest walk between the order the list happened to print them in. Two items a few metres apart but listed at opposite ends of a long pick list land next to each other in the solved sequence, cutting the doubling-back a fixed order keeps repeating.
Aisle & one-way constraints
Routes respect aisle directions, tunnels, access points and blocked locations.
The same constraints are re-applied at solve time rather than baked into a static map that goes stale, so a lane closed for a stock count or a spill is excluded from that wave's routes even though it's open every other day. Pickers stop being sent up an aisle only to turn around and re-route themselves.
Congestion aware
Busy aisles cost more; routes spread traffic instead of stacking it.
The cost added to a segment comes from how many other routes in that same wave are already assigned through it, recalculated wave by wave rather than pulled from a fixed busy-hours table. Routes go out already accounting for each other, so the first sign of a jam isn't a picker walking into one.
Measured gains
Travel per pick list vs your current sequence — the improvement in metres and minutes.
The same historical pick lists are replayed under both the old sequencing rule and the solved routes, so the comparison reflects real order patterns rather than a synthetic best case built to flatter TSP. The gain can be shown list by list and zone by zone, which is a harder number to argue with than a single average.
Frequently asked questions
Turning every pick list into a solved shortest route on the twin's real navigation graph.
Why solve routes as a TSP instead of using a serpentine rule?
Pick routes are travelling-salesman problems, and solving them properly beats any serpentine or S-shape rule. The engine finds a true shortest path rather than making straight-line guesses.
Does the router respect one-way aisles and blocked locations?
Yes. Routes honour aisle directions, tunnels, access points and blocked locations, so the sequence it returns is one pickers can actually walk.
How does the engine handle busy aisles?
It is congestion aware — busy aisles cost more in the solve, so routes spread traffic across the warehouse instead of stacking everyone into the same lane.
How is the improvement measured?
It compares travel per pick list against your current sequence and reports the gain in metres and minutes, so the benefit is concrete rather than theoretical.
What does the router run on?
The TSP solvers run on the twin's real navigation graph, which mirrors your actual aisle directions, access points and congestion — not a simplified straight-line map.
Do I need to replace my WMS to use the TSP engine?
No. WareBee works alongside your existing WMS as an optimisation layer, returning picking routes and sequences for your WMS and team to execute.