Back to all methods
DATUM ALGORITHMIC FAMILY

Method: Operations Research & Optimization

Mathematical programming models (MILP, LP, CP) for combinatorial scheduling, routing, and facility allocation under strict physical bounds.

#012
Safety Stock Optimization

We keep running out of stock

Why does stock hit zero before replenishment arrives?

#012 Buffer Sensitivity67% Service Fill
Buffer: 60u
⚠ 2 Stockout PeriodsLead Time: 12d
SAFETY BUFFER:+15 units
TOTAL STOCK:60 units
💡Averages feel safe, but variance triggers out-of-stock events.
Blueprint→
#024
Theory of Constraints

One bottleneck slows the entire plant

Which stage limits total throughput?

#024 Line Flow Simulation60 u/hr Bottleneck
120
Milling
60
CHOKE
Assembly
100
Testing
140
Packing
⚠ Assembly Constrains OutputMax Cap: 140u
OUTPUT:480 u/shift
BOTTLENECK:Assembly (60/h)
💡Improving non-bottlenecks creates inventory backlog.
Blueprint→
#032
Bin Packing

Trucks leave partially empty

How can orders be combined to use space better?

#032 3D Bin Packing58% Cube Fill
SKU-A
SKU-B
EMPTY AIR (42%)
⚠ Loose Stacking (Air Wasted)Fleet: 5 Vehicles
REQUIRED FLEET:5 Vehicles
FREIGHT SAVINGS:$0 (Base)
💡Pack loads tightly under dual weight-cube limits.
Blueprint→
#034
Vehicle Routing Problem (VRP)

Trucks travel too many kilometres

Can the same deliveries be completed with a better route?

#034 Vehicle Routing (TSP)86 km (-44% Distance)
DEPOT
⚠ Sub-Optimal Zigzag Routing$327 Fuel Cost
ROUTE MILEAGE:86 km
FUEL EXPENSE:$327 / run
💡Optimized route sequencing reduces miles and emission waste.
Blueprint→