APTIFOLD / RESILIENCE DESIGNER
Which backup is worth it?
You’re the dispatcher. Book transport and storage so each depot gets its order on time. Then close a route and see what still arrives.
A fictional freight problem. Costs are reservation units, not real prices.
ILLUSTRATIVE DISPATCH / Supply network
Eight crates. Two receiving windows.
Try it: close the north route. Can the same bookings still fill both orders?
The search checks every declared single-route closure. It applies the cheapest passing plan only if it fits your budget.
Why this step?
Routes show total crates dispatched during this scenario. Scrub the timeline to inspect a particular departure.
THE DISPATCH RECORD
Follow every departure.
The map shows the outcome. Here is one schedule that makes it happen. Select a time to inspect that departure on the board.
The trace accounts for routed stock, not every crate physically on site. Other maximum-delivery schedules may differ.
THE PRICE OF A BACKUP
Which backup earns its keep?
Each dot shows cost and on-time delivery in the worst tested case. Select one to inspect the bookings behind it.
Compute the comparison to see which plans earn their cost.
A bigger network is not automatically a better investment.
One plan can cost more and deliver no more in its worst case. We’ll set those beside the efficient alternatives, without hiding ties or over-budget choices.
Cost vs. worst-case delivery
Click a dot, or choose a result in the plan preview. Several plans can share one dot and still protect different closures.
● Efficient trade-off○ Other legal plan┊ Budget limit
Efficient means no cheaper-or-equal plan delivers more, and no equally good plan costs less. It does not mean best on every objective.
Before you change the bookings
Board unchangedWhat does this plan change?
Inspect every legal investment combination
| Investments | Cost | Ordinary run | Worst case | Cases met | Inspect |
|---|
ASK A QUESTION THE MODEL CAN ANSWER
What is this design relying on?
Take an investment away. Change one requirement. Look for the conditions where the result changes—and the ones where it doesn’t.
Tests keep your current investment selection fixed unless explicitly removing one.
CONDITIONAL DEPENDENCIES
Remove one piece.
Would the rest of this design still do the job?
A one-at-a-time removal tests this combination, not every possible replacement. Unchanged totals may hide a different failing order or corridor.
CONTROLLED CHANGES
Change the conditions.
These probes recalculate the same selected plan. They do not buy new investments.
FAILURE MAP
Which closure hurts most?
Every declared case, ordered by total on-time delivery. Counts are not failure probabilities.
Operating brief & assumptions
ILLUSTRATIVE SCENARIO
Units, assumptions & what’s left out
Receiving windows and capacity limits are established logistics constraints. This is a smaller network-capacity model, not a vehicle-routing solver. Time-window reference: OR-Tools.
Budget, deadline & network
See why the plan changesThree guided comparisons
Each step loads a built-in example onto the live board. Undo last change steps back one board change, including its network and reservations.
Compare the steps & inspect the evidence
These figures are recomputed by the same finite engine as the board. “Worst case” means the lowest on-time total across ordinary operation and each declared single-corridor closure—not a failure probability. Use the dispatch ledger and “What exactly is being proved?” below the board for exact schedules, bounds and assumptions. These are fictional teaching examples, not operating advice.
What if two corridors close together?
Open the joint-closure workshop ↗