Combinatorial Optimization

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. ...

Warehouse. That is a useful place to begin, because combinatorial optimization only sounds abstract until someone has to decide which trucks leave first, which jobs enter which machines, which items fit into which containers, or which solver should be trusted before the deadline starts laughing. In those systems, the hardest question is often not “What is the answer?” It is “Which method should we use for this particular instance?” One algorithm works beautifully on one family of cases and then quietly embarrasses itself on another. This is not a personality flaw. It is the normal condition of optimization. ...

Trucks do not care whether your routing algorithm is elegant. They care whether the vehicle arrives, whether the route violates capacity, whether the dispatch plan survives a late order, and whether the whole thing can be recomputed before someone in operations starts calling the system “that AI toy.” Optimization has always lived in this unglamorous place: close enough to mathematics to look pure, close enough to reality to be messy. ...