SKAI-LINE · ROUTE RESILIENCE LAB
Method & limits ↗A SMALL NETWORK. A DIFFERENT WAY THROUGH.
Which route holds up?
Compare uncertain journeys. Find the connections you cannot afford to lose.
MINIMAX REGRET
S → V → T
1 objective-optimal route
Assumed time interval
Maximum regret
Minimum cut size
02 / THE ADVERSARIAL TEST
How much could you wish you’d chosen differently?
For this fixed route, place every selected link at its upper time and every other usable link at its lower time. Then find the best route in that same scenario.
Best in hindsight: S → T. Shared links retain the same upper time for both routes.
THE METHOD / AND WHERE IT STOPS
Three different questions.
Optimistic minimizes the sum of lower times. Worst-case time minimizes the sum of upper times. Minimax regret minimizes the largest gap between a fixed route and the best route in hindsight.
Every combination of link times inside the intervals is permitted. No probabilities, expected times, confidence levels or coupled uncertainty are modelled. Coordinates only draw the graph.
The exact solver enumerates all simple routes in the bounded graph and checks one adverse scenario per route. Montemanni & Gambardella, 2005 ↗
Connections are not guarantees.
The minimum edge cut is the smallest number of usable links whose removal can disconnect the endpoints. It is structural redundancy, not a failure probability or an emergency egress assessment. MIT: max-flow / min-cut ↗
“No steps recorded” is just a supplied label. The filter excludes unknown and steps-present links, but does not assess slopes, widths, surfaces, doors, obstructions or individual access needs. Examples of other route dimensions ↗
A sketch, not a navigation app.
All examples are invented. PASSAGE has no real-time maps, traffic, travel-time calibration, safety certification or accessibility verification. Do not use it to direct real journeys or emergency decisions.
Your edits are held in this tab only. Reloading loses them unless you download a network file. Open-file processing stays in your browser; there is no project data upload, account requirement or paid AI call.
Free public experiment by SKAI-LINE ↗. Source and test details accompany each release.