Decisions, scheduled and routed
A surprising amount of operational decision-making is, mathematically, an optimisation problem dressed up as a workflow. Routing vehicles, scheduling shifts, allocating slots, packing containers, sequencing production, rostering crew, assigning cases to specialists — each of these can be expressed as an objective function, a set of constraints and a search procedure that finds a defensibly good solution within an acceptable time budget.
We use mathematical programming (LP, MIP, constraint programming), metaheuristics (simulated annealing, genetic algorithms, large-neighbourhood search) and learning-augmented optimisation depending on the structure of the problem. Where the problem is well-characterised and stable, exact methods are usually preferred. Where the problem space is vast and the objective is forgiving, heuristics scale better.
Optimisation systems live or die on their integration with the operational reality. The model that finds a globally optimal route is useless if the routes it finds violate informal constraints the planner held in their head. We surface those constraints explicitly during discovery, encode them in the model, and invest in the user interface that lets planners adjust solutions without throwing the optimisation away.
- Vehicle routing and last-mile
- Workforce scheduling and rostering
- Production sequencing and slot allocation
- Network and inventory optimisation
- Pricing and revenue optimisation
- Constraint programming for complex policies

