Online Menu-Based Scheduling of Electric Vehicle Charging
- 7 February 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 16 (3) , 2478-2491
Abstract
This paper addresses the problem of efficiently scheduling of EV charging requests in a single Charging Station (CS), also taking into consideration the inability of EV users to express their preferences in closed-form utility functions. We consider a paradigm where a menu of possible charging intervals, each associated with an urgency price, is generated online. By letting the EV users pick their most preferable menu option, the proposed algorithm commits on each EV’s charging completion time upon its arrival, achieves a near optimal total weighted charging completion time, and prevents the users from strategically misreporting their preferences, while offering a practical and implementable solution to the problem of EVs -charging station interaction. Our experimental evaluation demonstrates that our algorithmic approach performs nearly optimal in a variety of practically relevant scenarios.Keywords
Funding Information
- National Technical University of Athens (NTUA) Basic Research Grant (PEBE 2020) “Algorithm Design through Learning Theory: Learning-Augmented and Data-Driven Online Algorithms (LEADAlgo)”
This publication has 32 references indexed in Scilit:
- Optimal scheduling of electric vehicle ordered charging and discharging based on improved gravitational search and particle swarm optimization algorithmInternational Journal of Electrical Power & Energy Systems, 2024
- Electric vehicle clusters scheduling strategy considering real-time electricity prices based on deep reinforcement learningEnergy Reports, 2022
- Profit-based electric vehicle charging scheduling: Comparison with different strategies and impact assessment on distribution networksInternational Journal of Electrical Power & Energy Systems, 2022
- Truthfulness for the Sum of Weighted Completion Times2016
- Minimizing Total Flow Time and Total Completion Time with Immediate DispatchingAlgorithmica, 2007
- On-line scheduling to minimize average completion time revisitedOperations Research Letters, 2004
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds1996
- Improved scheduling algorithms for minsum criteria1996
- Scheduling jobs that arrive over time1995
- Preemptive Scheduling of Uniform Machines Subject to Release Dates1984