,
Matúš Mihalák
,
Filip Schlembach
,
Evgueni Smirnov
Creative Commons Attribution 4.0 International license
Electric vehicle adoption is growing rapidly, and parking facilities face increasing pressure to expand their charging infrastructure. This paper studies the power allocation scheduling problem that arises when a parking facility with fixed grid-capacity limit must distribute power to connected electric vehicles, under given lower and upper bounds on the charge rate at any given time. We focus on the optimization goal of maximizing the number of vehicles that get charged a given target of power, with the secondary goal of providing as much power as possible. We show that the problem is NP-hard. We formulate the problem as a mixed-integer linear program (MILP) that establishes a theoretical upper bound on performance of any online algorithm, which is the main goal of the real-world problem. We design and compare a few online scheduling strategies against the offline bound, using a real-world instance of vehicles and testing across 6 to 40 chargers. We use MILP as an online strategy, classical earliest-deadline first greedy algorithm, and we also design data-driven approaches using machine learning techniques. Results show that the simplest static load balancing approach cannot compete with the best performing online approach, and that the real-world problem can benefit from dynamic load balancing strategies such as those designed and evaluated in this paper.
@InProceedings{cavalcantilauro_et_al:OASIcs.ATMOS.2026.9,
author = {Cavalcanti Lauro, Bruna and Mihal\'{a}k, Mat\'{u}\v{s} and Schlembach, Filip and Smirnov, Evgueni},
title = {{Scheduling Electric-Vehicle Charging Under Grid Capacity and Minimum Charge Rates}},
booktitle = {26th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2026)},
pages = {9:1--9:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-453-6},
ISSN = {2190-6807},
year = {2026},
volume = {147},
editor = {Cacchiani, Valentina and Funke, Stefan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2026.9},
URN = {urn:nbn:de:0030-drops-278059},
doi = {10.4230/OASIcs.ATMOS.2026.9},
annote = {Keywords: Electric-Vehicle Charging, Scheduling, Grid-Capacity Constraints, Charge-Rate Lower-Bounds}
}