Layer 03 Logistics Intelligence

Dispatch strategy

The named configuration that decides who runs the order: owned fleet first, then contracted carriers, then gig capacity, with the fallbacks and the conditions for each. Where an optimization strategy decides how a route is built, a dispatch strategy decides which capacity runs it at all. Workflows can apply one, branch on it, and hand the result to an agent.

Where this fits

Layer 03 of the Nash platform: planning and live operations. Intelligent planning configures the routing rules, dynamic dispatch executes them, live operations adjusts as conditions change, and the provider network supplies the capacity to fulfill against.

Related terms

Least-cost routing: Selecting the cheapest capacity that can still hold the promise, rather than the cheapest capacity outright. Cost-only selection looks good per order and shows up later as failed drops, redeliveries, and support volume, so Nash scores cost against reliability and the committed window before it assigns.
Optimization strategy: The named, reusable configuration that decides how a route gets built: which objective to favor (fewest drivers, balanced load, lowest cost, tightest promise), and which constraints are hard rather than soft. Operations keep several and apply different ones per shift, zone, or vehicle type. Changing the strategy changes the shape of the day, which is why it is an object you version rather than a setting you nudge.
Exception management: Catching the routes and deliveries that break from plan and resolving them before they cost the operation. Rather than watch every order with equal weight, an operator manages by exception: the late pickup, the failed drop, the promise about to slip. Nash surfaces each with the context to act, resolves the routine ones on its own, and escalates only the few that need a person.
Routing constraint: A rule a route must respect to be executable rather than merely short: vehicle capability and capacity, driver certification, dock and appointment timing, service time per stop, shift length, and access at the address. An optimizer scoring only time and distance returns routes that look good on paper and cannot be run, which is how a sedan gets assigned five mattresses. Nash treats constraints as first-class inputs to dispatch and re-checks them on every re-optimization, not once at plan time.
Fleet: Drivers, installers, pick & pack, vehicles, drones, and autonomous units. All first-class capacity.