How fleet-management software computes a provably deterministic charge schedule across dozens of stalls and hundreds of vehicles, subject to route deadlines, power budgets, and battery health constraints.
The fleet-scheduling engine defines a binary decision variable for every vehicle, stall, and fifteen-minute timeslot, then minimizes a weighted cost of missed deadlines and unused V2G revenue subject to per-stall connector compatibility, per-feeder power limits, and each vehicle's onboard charger rating. The solver returns a matrix assignment that a shift supervisor can inspect and audit before it is dispatched to the stalls.
A single static schedule computed at midnight cannot survive contact with a driver who returns forty minutes early or a delivery route extended by traffic. The scheduling engine re-solves a rolling six-hour horizon every five minutes, holding already-dispatched stall assignments fixed while re-optimizing everything downstream so the plan stays feasible without disrupting sessions already in progress.