Dispatch Optimizer
Recommend feasible technician assignments under skills, capacity, service deadlines, travel, and overtime constraints.
- Method
- OR-Tools CP-SAT vehicle routing with time windows plus assignment, compared with naive and greedy plus 2-opt across 200 randomized scenarios.
- My role
- I defined the synthetic operation, implemented both baselines and the optimizer, and built the comparison interface.
- Result
- Greedy plus 2-opt beat naive in 199 of 200 scenarios, with a median 12 fewer service-level breaches. Across 24 scenarios, CP-SAT's median was 5 breaches behind that baseline at 8 seconds, 3 ahead at 30, and 5 ahead at 60.
- Limit
- Synthetic data, not a production operation. The timed solver is nondeterministic, so the distribution matters more than any one scenario.