Examples
Examples
Try the starting example
- Vehicles JSON [ID,arrival minute,departure minute,required delivered kWh]
- [["A",0,120,10],["B",0,180,10],["C",60,180,10]]
- Identical constant-power chargers JSON [ID,delivered kW]
- [["C1",10]]
- Allocation slot duration (minutes)
- 60
- Scheduling horizon (minutes)
- 180
- Charging schedule [charger,vehicle,start,end,delivered kWh]
- [["C1","A",0,60,10],["C1","B",60,120,10],["C1","C",120,180,10]]
- Unmet energy by vehicle [ID,kWh]
- [["A",0],["B",0],["C",0]]
- Total delivered energy (kWh)
- 30
- Total unmet energy (kWh)
- 0
Try another scenario
- Vehicles JSON [ID,arrival minute,departure minute,required delivered kWh]
- [["A",0,120,10],["B",0,180,10],["C",60,180,10]]
- Identical constant-power chargers JSON [ID,delivered kW]
- [["C1",10],["C2",10]]
- Allocation slot duration (minutes)
- 60
- Scheduling horizon (minutes)
- 180
- Charging schedule [charger,vehicle,start,end,delivered kWh]
- [["C1","A",0,60,10],["C2","B",0,60,10],["C1","C",60,120,10]]
- Unmet energy by vehicle [ID,kWh]
- [["A",0],["B",0],["C",0]]
- Total delivered energy (kWh)
- 30
- Total unmet energy (kWh)
- 0
Calculation method
Calculation method
Charging schedule [charger,vehicle,start,end,delivered kWh]
At each aligned time slot, allocate each charger to unassigned connected vehicle with earliest departure then ID; energy=min(remainingNeed,power*slot/60). One vehicle per charger and one charger per vehicle at a time.
Unmet energy by vehicle [ID,kWh]
max(0,need-sumDelivered).
Total delivered energy (kWh)
Sum schedule energy.
Total unmet energy (kWh)
Sum vehicle unmet energy.
Symbols and units
- a
- Vehicles JSON [ID,arrival minute,departure minute,required delivered kWh]
- b
- Identical constant-power chargers JSON [ID,delivered kW]
- c
- Allocation slot duration (minutes)
- d
- Scheduling horizon (minutes)
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Preemptive constant-power earliest-departure heuristic on aligned slots, not a global feasibility proof. Identical chargers, unit charging efficiency represented by delivered kW; partial final-slot energy is spread over slot. No taper, connector compatibility, battery limits, grid cap or electrical engineering assurance. Supported limits: 1..100 vehicles, 1..20 chargers with identical positive power; integer slot/horizon, horizon divisible by slot, <=1440 slots; arrivals/departures align to slot within horizon; needs>=0.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.