NETWORK FLOWS · FIVE CONNECTED QUESTIONS
A parked vehicle still has work to do.
Follow the work from depot capacity to the next rider. Each lesson asks one question, compares choices and keeps the trade-offs visible.
Synthetic scenario · not operational data
CAPACITY
Better scheduling, more bandwidth, or more charging power?
Twelve invented visits share data and energy resources. Compare one change, follow a vehicle, and find the limiting resource.
Find the constraintSOFTWARE DELIVERY
One update. Four vehicles. Where is the wait?
Compare repeated downloads with a shared depot copy. Follow the bytes, inspect the readiness target, then find a case where reuse delays a vehicle.
Share the workDELIVERY ORDER
Who gets the depot link first?
Reorder four vehicles, compare all 24 possibilities, and see who waits longer. Same bytes; different target outcomes.
Choose the orderREBALANCING
Where should the empty cars go?
Compare two repositioning rules for 24 vehicles. Read coverage beside empty travel, follow one vehicle, then try your own moves.
Position the fleetDISPATCH
Which car takes the next request?
Compare greedy assignment with joint matching. Follow one car, then see why the best assignment now can lose later.
Meet the rider
Deeper experiment, outside the five questions: What holds a car in the depot?
FleetLab