IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v93y2019i1d10.1007_s11134-019-09616-z.html
   My bibliography  Save this article

Bounds and limit theorems for a layered queueing model in electric vehicle charging

Author

Listed:
  • Angelos Aveklouris

    (Eindhoven University of Technology)

  • Maria Vlasiou

    (Eindhoven University of Technology)

  • Bert Zwart

    (Eindhoven University of Technology
    Centrum Wiskunde en Informatica)

Abstract

The rise of electric vehicles (EVs) is unstoppable due to factors such as the decreasing cost of batteries and various policy decisions. These vehicles need to be charged and will therefore cause congestion in local distribution grids in the future. Motivated by this, we consider a charging station with finitely many parking spaces, in which electric vehicles arrive in order to get charged. An EV has a random parking time and a random charging time. Both the charging rate per vehicle and the charging rate possible for the station are assumed to be limited. Thus, the charging rate of uncharged EVs depends on the number of cars charging simultaneously. This model leads to a layered queueing network in which parking spaces with EV chargers have a dual role, of a server (to cars) and a customer (to the grid). We are interested in the performance of the aforementioned model, focusing on the fraction of vehicles that get fully charged. To do so, we develop several bounds and asymptotic (fluid and diffusion) approximations for the vector process which describes the total number of EVs and the number of not fully charged EVs in the charging station, and we compare these bounds and approximations with numerical outcomes.

Suggested Citation

  • Angelos Aveklouris & Maria Vlasiou & Bert Zwart, 2019. "Bounds and limit theorems for a layered queueing model in electric vehicle charging," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 83-137, October.
    • Handle: RePEc:spr:queues:v:93:y:2019:i:1:d:10.1007_s11134-019-09616-z
    DOI: 10.1007/s11134-019-09616-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-019-09616-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-019-09616-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhang, Lidong & Jiang, Chunmei, 2009. "Stationary distribution of reflected O-U process with two-sided barriers," Statistics & Probability Letters, Elsevier, vol. 79(2), pages 177-181, January.
    2. Aldous, David, 1986. "Some interesting processes arising as heavy traffic limits in an M/M/[infinity] storage process," Stochastic Processes and their Applications, Elsevier, vol. 22(2), pages 291-313, July.
    3. Maria Remerova & Josh Reed & Bert Zwart, 2014. "Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 746-774, August.
    4. H. Christian Gromoll & Philippe Robert & Bert Zwart, 2008. "Fluid Limits for Processor-Sharing Queues with Impatience," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 375-402, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghotge, Rishabh & van Wijk, Ad & Lukszo, Zofia, 2021. "Off-grid solar charging of electric vehicles at long-term parking locations," Energy, Elsevier, vol. 227(C).
    2. Legros, Benjamin & Fransoo, Jan C., 2024. "Admission and pricing optimization of on-street parking with delivery bays," European Journal of Operational Research, Elsevier, vol. 312(1), pages 138-149.
    3. Jiaqi Zhou & Ilya O. Ryzhov, 2021. "Equilibrium analysis of observable express service with customer choice," Queueing Systems: Theory and Applications, Springer, vol. 99(3), pages 243-281, December.
    4. Hung, Ying-Chao & PakHai Lok, Horace & Michailidis, George, 2022. "Optimal routing for electric vehicle charging systems with stochastic demand: A heavy traffic approximation approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 526-541.
    5. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Agostino Capponi & Xu Sun & David D. Yao, 2020. "A Dynamic Network Model of Interbank Lending—Systemic Risk and Liquidity Provisioning," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1127-1152, August.
    2. Łukasz Kruk, 2017. "Edge minimality of EDF resource sharing networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 331-366, October.
    3. Qingpei Zang & Lixin Zhang, 2019. "Asymptotic Behaviour of the Trajectory Fitting Estimator for Reflected Ornstein–Uhlenbeck Processes," Journal of Theoretical Probability, Springer, vol. 32(1), pages 183-201, March.
    4. Legros, Benjamin & Jouini, Oualid & Akşin, O. Zeynep & Koole, Ger, 2020. "Front-office multitasking between service encounters and back-office tasks," European Journal of Operational Research, Elsevier, vol. 287(3), pages 946-963.
    5. Legros, Benjamin & Jouini, Oualid, 2019. "On the scheduling of operations in a chat contact center," European Journal of Operational Research, Elsevier, vol. 274(1), pages 303-316.
    6. Josh Reed & Bert Zwart, 2014. "Limit Theorems for Markovian Bandwidth-Sharing Networks with Rate Constraints," Operations Research, INFORMS, vol. 62(6), pages 1453-1466, December.
    7. Jiheng Zhang & J. G. Dai & Bert Zwart, 2009. "Law of Large Number Limits of Limited Processor-Sharing Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 937-970, November.
    8. Chen, Claire Y.T. & Sun, Edward W. & Miao, Wanyu & Lin, Yi-Bing, 2024. "Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1086-1107.
    9. Otis B. Jennings & Jamol Pender, 2016. "Comparisons of ticket and standard queues," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 145-202, October.
    10. Qiang Zhen & Johan Leeuwaarden & Charles Knessl, 2010. "On a processor sharing queue that models balking," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 453-476, December.
    11. Ioannis Dimitriou, 2021. "On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency," Queueing Systems: Theory and Applications, Springer, vol. 98(1), pages 95-143, June.
    12. Achal Bassamboo & Sunil Kumar & Ramandeep S. Randhawa, 2009. "Dynamics of New Product Introduction in Closed Rental Systems," Operations Research, INFORMS, vol. 57(6), pages 1347-1359, December.
    13. Maria Remerova & Josh Reed & Bert Zwart, 2014. "Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 746-774, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:93:y:2019:i:1:d:10.1007_s11134-019-09616-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.