Abstract

To reduce carbon emission in the transportation sector, there is currently a steady move taking place to an electrified transportation system. This brings about various issues for which a promising solution involves the construction and operation of a battery swapping infrastructure rather than in-vehicle charging of batteries. In this paper, we study a closed Markovian queueing network that allows for spare batteries under a dynamic arrival policy. We propose a provisioning rule for the capacity levels and show that these lead to near-optimal resource utilization, while guaranteeing good quality-of-service levels for electric vehicle users. Key in the derivations is to prove a state-space collapse result, which in turn implies that performance levels are as good as if there would have been a single station with an aggregated number of resources, thus achieving complete resource pooling.

Highlights

  • A key challenge in the deployment and take-up of electric vehicles by society is the provision of a scalable charging infrastructure

  • There has been work done on the operation and control of a single battery swapping station, but there is a clear gap within the literature when extending this to the operation of a wider network of stations

  • We introduce a novel stochastic network model describing a network of battery swapping stations which clearly addresses this need and provides a foundation for future studies

Read more

Summary

Introduction

A key challenge in the deployment and take-up of electric vehicles by society is the provision of a scalable charging infrastructure. This policy leads to favorable performance for large systems: as the number of customers r grows large, the waiting probability te√nds to a value strictly between zero and one, the waiting√time vanishes with a rate 1/ r , and near-optimal resource utilization of 1 − O(1/ r ) is achieved To inherit such properties for the battery swapping framework, we adopt a similar capacity level design policy for both the number of charging servers and the number of spare batteries relative to the expected offered load under the load-balancing arrival strategy. The introduction of the novel framework within this paper acts as a foundation for a substantial research program in the modeling of battery swapping networks This will provide practitioners with a better understanding of how such networks should be designed and operated from both the perspective of quality of service requirements and from an economic viewpoint.

Model description
System behavior in case of a single swapping station
Steady-state distribution
Limiting queue length behavior
Performance measures
System behavior in case of multiple stations
System dynamics
Fluid limit
Diffusion limit
Simulation experiments
Large-scale system
State-space collapse for exponential charging times
Universality result for charging time distribution
The role of system size
Moderate-sized system
A Fluid limit proof
B State-space collapse proofs
Hydrodynamic scaling and its limiting process
The SSC function
Multiplicative state-space collapse
Strong state-space collapse
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call