Operations Research

TL;DR for operators A business user can ask an optimization copilot for a schedule, allocation, or planning model while leaving objectives, constraints, or policy boundaries partly unstated. Two plausible interpretations can then produce different mathematical formulations even when both look coherent. The risk is not bad algebra. It is premature formulation. OR-Clarify, introduced in Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization,1 evaluates whether an agent identifies formulation-critical missing information before modeling, recovers it through questioning, avoids filling gaps with unconfirmed defaults, and stops at an appropriate point. ...

TL;DR for operators A routing system can observe congestion accurately and still price a route badly. The reason is temporal: current speed is highly relevant to a road a vehicle will enter now, but it can be a poor estimate for a segment the vehicle will not reach for several minutes. HLSR1 addresses that mismatch without continually reconsidering every vehicle in the network. It selects vehicles plausibly affected by detected congestion, then changes how much it trusts live versus predicted traffic according to when each route segment is expected to be reached. ...

TL;DR for operators Bus route planning is a familiar kind of organisational pain: every local decision looks defensible until it interacts with the rest of the network. Add one promising segment, and you may improve coverage. Or you may create redundant overlap, force ugly transfers, consume fleet capacity, and make the whole system worse. Charming. ...

Scheduling a factory, routing a fleet, pricing airline seats, allocating scarce capacity: these are not “write me a Python script” problems with nicer stationery. In real operations research, the useful answer is not merely a correct mathematical model. It is a method that stays feasible, keeps solution quality high, and finishes before the business context has expired. ...

Opening — Why this matters now The first wave of enterprise AI adoption was obsessed with model choice. Which model is smarter? Which model writes better? Which model can reason, code, browse, call tools, summarize contracts, and politely pretend it enjoys quarterly planning? That was the easy part. The less glamorous question is now becoming more expensive: how do we serve all these model calls reliably, cheaply, and at scale? ...

A warehouse manager does not ask for “a constraint optimization problem.” She asks whether tomorrow’s orders can be shipped without overtime. A university administrator does not request “a mixed-integer formulation.” He asks whether lectures can be scheduled without room conflicts. A retail planner does not want “a MiniZinc model.” She wants to know which stores should receive scarce inventory before the promotion starts. ...

Routes look clean on a dashboard. A line leaves the depot, touches a sequence of customers, maybe bends toward a charging station, and returns home. The illusion is that route planning is still mostly about drawing the shortest useful line. Electric fleets ruin that illusion rather quickly. A diesel truck can treat refueling as an annoying but usually minor detail. An electric vehicle cannot. Battery capacity turns distance into feasibility. Charging stations turn geography into detours. A route that looks efficient before charging may become expensive after charging; a route that looks wasteful may avoid a much uglier charging pattern. This is why the Electric Capacitated Vehicle Routing Problem, or E-CVRP, is not merely the old vehicle-routing problem wearing a green jacket. It is a coupled routing-and-energy problem, and coupling is where algorithms go to lose their innocence. ...

Decision teams rarely ask for a beautiful frontier. They ask for a choice. A product team needs one configuration to ship. A materials lab needs one candidate to synthesize next. A vehicle design team needs one design worth sending through another expensive simulation. A trading infrastructure team needs one setting that balances latency, risk, and cost. Nobody walks into the Monday meeting and says, with a straight face, “Please deploy the entire trade-off surface.” At least not twice. ...

Routes are easy to describe and annoying to optimize. A manager says, “Send these vehicles to these customers, respect capacity, keep priority clients early in the route, and do not let transport cost grow linearly because the real world, regrettably, has opinions.” The sentence is simple. The optimization problem is not. One path leads to a mixed-integer model that looks respectable until the solver spends the budget proving very little. Another path leads to a specialized routing solver that is fast, polished, and suddenly offended by the custom rule you actually need. A third path leads to hand-written heuristics that work beautifully until the person who wrote them leaves. ...

Schedules break in the small gaps. A delivery truck leaves at the right time, but the loading dock was not open yet. A watering pump arrives near the plant, but the tap is not being opened by the second worker at the same moment. A rescue boat reaches the correct coordinate, but after the deadline. In normal business language, these are “coordination issues.” In automated planning language, they are temporal constraints, numeric resources, durative actions, invariants, and interference rules. ...