The staff scheduler I wrote about a few weeks ago was a MILP — a Mixed Integer Linear Program. You define variables, constraints, and an objective function. Hand it to a solver, get an answer. Clean, relatively tractable, runs in seconds on a laptop.
The vehicle routing problem is something else entirely.
That’s not as dramatic as it sounds. The MILP model — the math, the constraints, the logic — that came together during the Fiverr engagement described in the first post of this series. What took 20 years was accumulating enough Operations Research experience to know what the model needed to look like. The actual build, once I sat down with the problem fully understood, was fast.
The web app took a few days. The deployment took an afternoon, plus one failed attempt that taught me about gunicorn.
When you convert an optimization model from Excel to standalone Python, you expect to do some work. You expect to rewrite the data loading, restructure the variable definitions, test the output. What you don’t expect is for the model to fail in three distinct ways, each one caused by something the Excel version was handling silently without you knowing it.
That’s what happened here. Three bugs. All real. All the kind that would have stayed invisible forever if the model had stayed in the spreadsheet.
PuLP is a Python library for writing optimization models. MILP stands for Mixed Integer Linear Program. CBC is an open-source solver. Together, they’re what makes the Staff Scheduler work — and together, they represent something I find genuinely interesting: the fact that problems that used to require expensive commercial software and specialized hardware can now be solved on a laptop, for free, in a few seconds.
Let me explain what’s actually happening under the hood.