Skip to content

Logistics Routing Plan

Operational-planning artifact — instantiates Central Reserve Redeployment

The standing plan that decides which front the reserve flows to first and in what feasible sequence, encoding an explicit front-priority ranking against a map of the network's capacities and constraints.

Several fronts want the reserve; someone has to have decided, before the rush, who gets it first and whether the route even works. Logistics Routing Plan is that decision made into an artifact. It carries two things a dispatcher cannot invent under pressure: an explicit ranking of the fronts, so the reserve is concentrated on the one that matters most rather than the one that called first, and a map of the network's real constraints — capacities, precedence, incompatibilities — so the allocation it produces is actually feasible. Its defining idea is that redeployment is a planned allocation under constraint, not first-come-first-served: the plan turns "everyone needs it" into "serve this front, then that one, along routes that will physically carry the load."

Example

A regional food bank holds a central reserve of pallets at one warehouse and supplies dozens of pantries. A cut to benefits spikes demand across three counties at once. The routing plan already encodes what to do: pantries serving the most acute, least-substitutable need rank first, and a constraint map records which pantries can take refrigerated goods, which cannot receive after 3 p.m., and which delivery must precede which on a shared truck.

When the surge hits, the plan concentrates the reserve on the highest-need county first and sequences the trucks so cold-chain items only go where there is refrigeration and every stop is reachable within its window. The pallets flow to where they relieve the most hardship, in an order the network can actually execute — not scattered evenly, and not dumped on whichever pantry phoned first.

How it works

What distinguishes a routing plan from a dispatch log is that it commits, in advance, to priority and feasibility:

  • Rank the fronts explicitly — write down what makes one front outrank another (severity, strategic value, irreversibility of loss) so concentration is deliberate and auditable, not ad hoc.
  • Map the binding constraints — capture the capacities, precedence, and incompatibilities that any allocation must respect, so the plan can't propose something the network can't do.
  • Allocate under both at once — resolve competing fronts into a concrete assignment and sequence for the reserve that honors the ranking and stays feasible.
  • Author ahead, execute live — settle the hard trade-offs before the event so real-time dispatch is execution, not deliberation.

Tuning parameters

  • Priority basis — what actually ranks fronts: acute severity, strategic value, or reversibility of the loss. This choice quietly decides who waits.
  • Constraint fidelity — how many real limits the map encodes versus abstracts away. More faithful plans are feasible but heavier to maintain and slower to solve.
  • Allocation shape — concentrate the reserve on the top front or spread it across many. Concentration creates decisive local advantage; spreading avoids abandoning lesser fronts.
  • Plan horizon and refresh — how far ahead the plan reaches and how often it is redrawn. A longer horizon coordinates better and goes stale faster.
  • Centralization — one master plan versus delegated local plans operating inside central guardrails.

When it helps, and when it misleads

Its strength is that it makes concentration both intentional and feasible. The archetype's whole advantage — reaching the decisive front before dispersed alternatives can coordinate — is squandered if the reserve dribbles out first-come-first-served or is routed somewhere it physically can't land. A good plan spends the reserve where it decides the outcome, along routes that will bear it.

Its failure modes track its two halves. A plan built on a stale constraint map routes confidently into a closed dock or a broken cold chain. And naively optimizing a routed network can backfire outright — adding a shortcut or a route can, counter-intuitively, worsen total flow.[1] The classic misuse is a priority rule quietly tuned to favor the loudest or most political front while wearing the neutral language of "the plan." The discipline is to keep the constraint map current and the priority basis explicit and reviewable, so both the feasibility and the fairness of the allocation can be checked.

How it implements the components

Logistics Routing Plan fills the allocation-policy side of the archetype — who is served first and what the network allows:

  • front_priority_rule — it encodes the explicit ranking that decides which front the reserve serves first when they compete.
  • dependency_and_constraint_map — it records the capacities, precedence, and incompatibilities any routing must respect for an allocation to be feasible.

It does not keep any single route ready and health-checked — that is the Standby Transport Corridor; it does not hold the live operating picture or coordinate the handoff — that is the Dispatch Center; and it does not solve the assignment in real time against live capacity — that is the Capacity-Aware Dispatch Optimizer.

Notes

Priority and feasibility can pull against each other: the nominally top-ranked front may be the one the network cannot currently serve (no refrigeration, no open dock). The plan's real job is the best feasible concentration — the highest-priority front that can actually be reached now — which is why the priority rule is worthless without the constraint map beside it, and vice versa.

References

[1] Braess's paradox — the counter-intuitive result that adding a route to a congested network can make overall travel times worse, because of how flow redistributes. It is the standard caution that a routing plan is not improved simply by adding capacity or paths; the whole allocation has to be reasoned about, not just each link. ↩