The charging infrastructure for electric vehicles faces the challenges of insufficient capacity and long charging duration. These challenges decrease the electric vehicle users’ satisfaction and lower the profits of infrastructure providers. Reservation systems can mitigate these issues. We introduce a reference architecture for interoperable reservation systems. The advantages of the proposed architecture are: it (1) considers the needs of the most relevant electric mobility stakeholders, (2) satisfies the interoperability requirements of existing technological heterogeneity, and (3) provides a classification of reservation types based on a morphological methodology. We instantiate the reference architecture and verify its interoperability and fulfillment of stakeholder requirements. Further, we demonstrate a proof-of-concept by instantiating and implementing an ad-hoc reservation approach. Our validation was based on simulations of real-world case studies for various reservation deployments in the Netherlands. We conclude that, in certain high demand situations, reservations can save significant time for electric vehicle trips. The findings indicate that a reservation system does not directly increase the utilization of the charging infrastructure.
As electric vehicles (EVs) are slowly becoming a common occurrence on roads, commercial EV charging is becoming a standard commercial service. With this development, charging station operators are looking for ways to make their charging services more profitable or allocate the available resources optimally. Dynamic pricing is a proven technique to increase revenue in markets with heterogeneous demand. This paper proposes a Markov Decision Process (MDP)-based approach to revenue- or utilization- maximizing dynamic pricing for charging station operators. We implement the method using a Monte Carlo Tree Search (MCTS) algorithm and evaluate it in simulation using a range of problem instances based on a real-world dataset of EV charging sessions. We show that our approach provides near-optimal pricing decisions in milliseconds for large-scale problems, significantly increasing revenue or utilization over the flat-rate baseline under a range of parameters.
15 May 2025 in IEEE Transactions on Intelligent Transportation Systems
This paper introduces a novel model for online dynamic pricing of electric vehicle charging services that integrates reservation, parking, and charging into a comprehensive bundle priced as a whole. Our approach focuses on the individual high-demand, fast-charging location, employing a Poisson process as a model of charging reservation arrivals, and develops an online dynamic pricing strategy optimized through a Markov Decision Process (MDP). A key contribution is the novel analysis of discretization error introduced when incorporating the continuous-time Poisson process into the discrete MDP framework. The MDP model’s feasibility is demonstrated with a heuristic dynamic pricing method based on Monte-Carlo tree search, offering a viable path for real-world applications.
For solving problems from the domain of Mobility-on-Demand (MoD), we often need to connect vehicle plans into plans spanning longer time, a process we call plan chaining. As we show in this work, chaining of the plans can be used to reduce the size of MoD providers' fleet (fleet-sizing problem) but also to reduce the total driven distance by providing high-quality vehicle dispatching solutions in MoD systems. Recently, a solution that uses this principle has been proposed to solve the fleet-sizing problem. The method does not consider the time flexibility of the plans. Instead, plans are fixed in time and cannot be delayed. However, time flexibility is an essential property of all vehicle problems with time windows. This work presents a new plan chaining formulation that considers delays as allowed by the time windows and a solution method for solving it. Moreover, we prove that the proposed plan chaining method is optimal, and we analyze its complexity. Finally, we list some practical applications and perform a demonstration for one of them: a new heuristic vehicle dispatching method for solving the static dial-a-ride problem. The demonstration results show that our proposed method provides a better solution than the two heuristic baselines for the majority of instances that cannot be solved optimally. At the same time, our method does not have the largest computational time requirements compared to the baselines. Therefore, we conclude that the proposed optimal chaining method provides not only theoretically sound results but is also practically applicable.
About Me
PhD student at Artificial Intelligence Center at Czech Technical University in Prague.
PhD student at Artificial Intelligence Center at Czech Technical University in Prague.