IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v99y2021i1d10.1007_s11134-021-09707-w.html
   My bibliography  Save this article

Complete resource pooling of a load-balancing policy for a network of battery swapping stations

Author

Listed:
  • Fiona Sloothaak

    (Eindhoven University of Technology)

  • James Cruise

    (Riverlane)

  • Seva Shneer

    (Heriot-Watt University
    Novosibirsk State University)

  • Maria Vlasiou

    (Eindhoven University of Technology
    University of Twente)

  • Bert Zwart

    (Eindhoven University of Technology
    Centrum Wiskunde & Informatica)

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.

Suggested Citation

  • Fiona Sloothaak & James Cruise & Seva Shneer & Maria Vlasiou & Bert Zwart, 2021. "Complete resource pooling of a load-balancing policy for a network of battery swapping stations," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 65-120, October.
    • Handle: RePEc:spr:queues:v:99:y:2021:i:1:d:10.1007_s11134-021-09707-w
    DOI: 10.1007/s11134-021-09707-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-021-09707-w
    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-021-09707-w?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. Bo Zhang & Johan S. H. van Leeuwaarden & Bert Zwart, 2012. "Staffing Call Centers with Impatient Customers: Refinements to Many-Server Asymptotics," Operations Research, INFORMS, vol. 60(2), pages 461-474, April.
    2. Galit B. Yom-Tov & Avishai Mandelbaum, 2014. "Erlang-R: A Time-Varying Queue with Reentrant Customers, in Support of Healthcare Staffing," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 283-299, May.
    3. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    4. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    5. Francis de Véricourt & Otis B. Jennings, 2011. "Nurse Staffing in Medical Units: A Queueing Perspective," Operations Research, INFORMS, vol. 59(6), pages 1320-1331, December.
    6. Tolga Tezcan, 2008. "Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 51-90, February.
    7. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    8. Sun, Bo & Sun, Xu & Tsang, Danny H.K. & Whitt, Ward, 2019. "Optimal battery purchasing and charging strategy at electric vehicle battery swap stations," European Journal of Operational Research, Elsevier, vol. 279(2), pages 524-539.
    9. Sem Borst & Avi Mandelbaum & Martin I. Reiman, 2004. "Dimensioning Large Call Centers," Operations Research, INFORMS, vol. 52(1), pages 17-34, February.
    Full references (including those not matched with items on IDEAS)

    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. Avishai Mandelbaum & Petar Momčilović & Yulia Tseytlin, 2012. "On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers," Management Science, INFORMS, vol. 58(7), pages 1273-1291, July.
    2. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    3. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    4. Li Xiao & Susan H. Xu & David D. Yao & Hanqin Zhang, 2022. "Optimal staffing for ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 309-351, October.
    5. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    6. Sunil Kumar & Ramandeep S. Randhawa, 2010. "Exploiting Market Size in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 511-526, September.
    7. Ramandeep S. Randhawa, 2016. "Optimality gap of asymptotically derived prescriptions in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 131-155, June.
    8. Patrick Eschenfeldt & David Gamarnik, 2018. "Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 867-886, August.
    9. Itai Gurvich & Junfei Huang & Avishai Mandelbaum, 2014. "Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 325-373, May.
    10. Avishai Mandelbaum & Petar Momčilović, 2008. "Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 561-586, August.
    11. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    12. Ingolfsson, Armann & Almehdawe, Eman & Pedram, Ali & Tran, Monica, 2020. "Comparison of fluid approximations for service systems with state-dependent service rates and return probabilities," European Journal of Operational Research, Elsevier, vol. 283(2), pages 562-575.
    13. Avishai Mandelbaum & Sergey Zeltyn, 2009. "Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers," Operations Research, INFORMS, vol. 57(5), pages 1189-1205, October.
    14. Matthew Gombolay & Toni Golen & Neel Shah & Julie Shah, 2019. "Queueing theoretic analysis of labor and delivery," Health Care Management Science, Springer, vol. 22(1), pages 16-33, March.
    15. Jinsheng Chen & Jing Dong, 2024. "Managing flexibility: optimal sizing and scheduling of flexible servers," Queueing Systems: Theory and Applications, Springer, vol. 108(3), pages 415-474, December.
    16. Ragavendran Gopalakrishnan & Sherwin Doroudi & Amy R. Ward & Adam Wierman, 2016. "Routing and Staffing When Servers Are Strategic," Operations Research, INFORMS, vol. 64(4), pages 1033-1050, August.
    17. Petar Momčilović & Amir Motaei, 2018. "QED limits for many-server systems under a priority policy," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 125-159, October.
    18. Heemskerk, M. & Mandjes, M. & Mathijsen, B., 2022. "Staffing for many-server systems facing non-standard arrival processes," European Journal of Operational Research, Elsevier, vol. 296(3), pages 900-913.
    19. Galit B. Yom-Tov & Avishai Mandelbaum, 2014. "Erlang-R: A Time-Varying Queue with Reentrant Customers, in Support of Healthcare Staffing," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 283-299, May.
    20. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.

    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:99:y:2021:i:1:d:10.1007_s11134-021-09707-w. 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.