{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T03:39:57Z","timestamp":1779248397561,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP21K11774"],"award-info":[{"award-number":["JP21K11774"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this study, we use a closed BCMP queueing network model designed for multiple customer classes and servers to optimize the number of servers at each node. This optimization is achieved by setting an upper limit on the number of servers and using an objective function that combines the standard deviation of the average number of customers in the system with the server installation cost. We use a genetic algorithm with parallel computations for the optimization process. Our findings demonstrate that this approach is viable for closed BCMP network models that require extensive computational resources. The optimal server count is validated by comparing the optimization results with the maximum number of servers utilized. Node popularity is predetermined, and a gravity model is employed to generate transition probabilities, rendering the model applicable to real-world scenarios. Our optimization results indicate that both the node popularity and distance between nodes influence the server count. Furthermore, simulations were conducted to evaluate the effect of the number of servers on the optimization outcomes. Allowing variations in the node count, location, and popularity makes this study flexible and adaptable to various real-world scenarios, such as transportation systems, healthcare facilities, and commercial spaces. Moreover, by providing an efficient and scalable solution, this study serves as a cornerstone for future research in this field and offers a practical tool for facility managers aiming to minimize both congestion and operational costs.<\/jats:p>","DOI":"10.1007\/s41060-024-00621-x","type":"journal-article","created":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T08:02:22Z","timestamp":1723622542000},"page":"2605-2614","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Proposal for optimizing number of servers in closed BCMP queueing network"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6030-3589","authenticated-orcid":false,"given":"Shinya","family":"Mizuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuki","family":"Komiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haruka","family":"Ohba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,14]]},"reference":[{"key":"621_CR1","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/opre.5.4.518","volume":"5","author":"JR Jackson","year":"1957","unstructured":"Jackson, J.R.: Networks of waiting lines. Oper. Res. 5, 518\u2013521 (1957). https:\/\/doi.org\/10.1287\/opre.5.4.518","journal-title":"Oper. Res."},{"key":"621_CR2","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.15.2.254","volume":"15","author":"WJ Gordon","year":"1967","unstructured":"Gordon, W.J., Newell, G.F.: Closed queuing systems with exponential servers. Oper. Res. 15, 254\u2013265 (1967). https:\/\/doi.org\/10.1287\/opre.15.2.254","journal-title":"Oper. Res."},{"key":"621_CR3","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F Baskett","year":"1975","unstructured":"Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22, 248\u2013260 (1975). https:\/\/doi.org\/10.1145\/321879.321887","journal-title":"J. ACM"},{"key":"621_CR4","doi-asserted-by":"publisher","unstructured":"Mizuno, S.: Limitations of calculating theoretical solutions for closed BCMP queueing networks and verification of alternative theoretical values by parallel simulation, Preprint. (2022). https:\/\/doi.org\/10.21203\/rs.3.rs1826465\/v1","DOI":"10.21203\/rs.3.rs1826465\/v1"},{"key":"621_CR5","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1186\/s40064-016-3703-2","volume":"5","author":"S Mizuno","year":"2016","unstructured":"Mizuno, S., Iwamoto, S., Seki, M., Yamaki, N.: Proposal for optimal placement platform of bikes using queueing networks. Springerplus 5, 2071 (2016). https:\/\/doi.org\/10.1186\/s40064-016-3703-2","journal-title":"Springerplus"},{"key":"621_CR6","doi-asserted-by":"publisher","first-page":"220","DOI":"10.11221\/jima.69.220","volume":"69","author":"S Mizuno","year":"2019","unstructured":"Mizuno, S., Suzuki, K., Imai, H., Yamaki, N.: Effect of simulated cooperation on optimal node placement using a queuing network. J. Jpn. Ind. Manag. Assoc. 69, 220\u2013228 (2019). https:\/\/doi.org\/10.11221\/jima.69.220","journal-title":"J. Jpn. Ind. Manag. Assoc."},{"key":"621_CR7","doi-asserted-by":"publisher","unstructured":"Mizuno, S., Ohba, H.: Optimal nodes placement using a closed BCMP queueing network (2023). https:\/\/doi.org\/10.21203\/rs.3.rs-2522053\/v1","DOI":"10.21203\/rs.3.rs-2522053\/v1"},{"key":"621_CR8","doi-asserted-by":"publisher","unstructured":"Legato, P., Mazza, R.M.: Class aggregation for multi-class queueing networks with FCFS multi-server stations. Queueing theory and network applications. In: 14th international conference, Ghent, Belgium, 27\u201329 Aug, pp 221\u2013239 (2019). https:\/\/doi.org\/10.1007\/978-3-030-27181-7_14","DOI":"10.1007\/978-3-030-27181-7_14"},{"key":"621_CR9","unstructured":"Suri, R., Sahu, S.K., Vernon, M.K.: Approximate mean value analysis for closed queuing networks with multiple-server stations, In: Proceedings of the 2007 industrial engineering research conference, pp 1\u20136 (2007)"},{"key":"621_CR10","doi-asserted-by":"publisher","unstructured":"Zhou, S., Woodside, M.: A robust approximation for multiclass multiserver queues with applications to microservices systems. In: Gilly, K., Thomas, N. (eds.), Computer performance engineering. Lecture notes computer science, vol. 13659. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25049-1_4","DOI":"10.1007\/978-3-031-25049-1_4"},{"key":"621_CR11","first-page":"599","volume":"78","author":"J Dad","year":"2011","unstructured":"Dad, J., Ouali, M., Lebbah, Y.: A multiclass BCMP queueing modeling and simulation-based road traffic flow analysis. World Acad. Sci. Eng. Technol. 78, 599 (2011)","journal-title":"World Acad. Sci. Eng. Technol."},{"key":"621_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s11134-009-9130-0","volume":"62","author":"J Xie","year":"2009","unstructured":"Xie, J., He, Q.M., Zhao, X.: On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers. Queueing Syst. 62, 255\u2013277 (2009). https:\/\/doi.org\/10.1007\/s11134-009-9130-0","journal-title":"Queueing Syst."},{"key":"621_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0166-5316(96)00048-X","volume":"29","author":"R Schmidt","year":"1997","unstructured":"Schmidt, R.: An approximate MVA algorithm for exponential, class-dependent multiple servers. Perform. Eval. 29, 245\u2013254 (1997). https:\/\/doi.org\/10.1016\/S0166-5316(96)00048-X","journal-title":"Perform. Eval."},{"key":"621_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-5316(02)00099-8","volume":"51","author":"S Balsamo","year":"2003","unstructured":"Balsamo, S., De Nitto Person\u00e8, V., Inverardi, P.: A review on queueing network models with finite capacity queues for software architectures performance prediction. Perform. Eval.Eval. 51, 269\u2013288 (2003). https:\/\/doi.org\/10.1016\/S0166-5316(02)00099-8","journal-title":"Perform. Eval.Eval."},{"key":"621_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ejor.2016.07.035","volume":"256","author":"H Baumann","year":"2017","unstructured":"Baumann, H., Sandmann, W.: Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers. Eur. J. Oper. Res. 256, 187\u2013195 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.07.035","journal-title":"Eur. J. Oper. Res."},{"key":"621_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/75372.75388","volume":"17","author":"DB Wagner","year":"1989","unstructured":"Wagner, D.B., Lazowska, E.D.: Parallel simulation of queueing networks: limitations and potentials. Sigmetrics Perform. Eval. Rev. 17, 146\u2013155 (1989). https:\/\/doi.org\/10.1145\/75372.75388","journal-title":"Sigmetrics Perform. Eval. Rev."},{"key":"621_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1019149712019","volume":"27","author":"L Chen","year":"1997","unstructured":"Chen, L.: Parallel simulation by multi-instruction, longest-path algorithms. Queueing Syst. 27, 37\u201354 (1997). https:\/\/doi.org\/10.1023\/A:1019149712019","journal-title":"Queueing Syst."},{"key":"621_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1287\/moor.24.2.293","volume":"24","author":"CH Papadimitriou","year":"1999","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of optimal queuing network control. Math. Oper. Res. 24, 293\u2013305 (1999). https:\/\/doi.org\/10.1287\/moor.24.2.293","journal-title":"Math. Oper. Res."},{"key":"621_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018922412074","volume":"92","author":"KD Glazebrook","year":"1999","unstructured":"Glazebrook, K.D., Ni\u00f1o-Mora, J.: A linear programming approach to stability, optimization and performance analysis for Markovian multiclass queueing networks. Ann. Oper. Res. 92, 1\u201318 (1999). https:\/\/doi.org\/10.1023\/A:1018922412074","journal-title":"Ann. Oper. Res."},{"key":"621_CR20","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ejor.2010.12.015","volume":"211","author":"DK George","year":"2011","unstructured":"George, D.K., Xia, C.H.: Fleet-sizing and service availability for a vehicle rental system via closed queueing networks. Eur. J. Oper. Res. 211, 198\u2013207 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2010.12.015","journal-title":"Eur. J. Oper. Res."},{"key":"621_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s13676-014-0054-4","volume":"5","author":"A Waserhole","year":"2016","unstructured":"Waserhole, A., Jost, V.: Pricing in vehicle sharing systems: optimization in queuing networks with product forms. Eur. J. Transp. Logist. 5, 293\u2013320 (2016). https:\/\/doi.org\/10.1007\/s13676-014-0054-4","journal-title":"Eur. J. Transp. Logist."},{"key":"621_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tranpol.2022.09.015","volume":"128","author":"A Torkey","year":"2022","unstructured":"Torkey, A., Abdelgawad, H.: Framework for planning of EV charging infrastructure: where should cities start? Transp. Policy 128, 193\u2013208 (2022). https:\/\/doi.org\/10.1016\/j.tranpol.2022.09.015","journal-title":"Transp. Policy"},{"key":"621_CR23","doi-asserted-by":"publisher","first-page":"111719","DOI":"10.1016\/j.rser.2021.111719","volume":"153","author":"MO Metais","year":"2022","unstructured":"Metais, M.O., Jouini, O., Perez, Y., Berrada, J., Suomalainen, E.: Too much or not enough? Planning electric vehicle charging infrastructure: a review of modeling options. Renew. Sustain. Energy Rev. 153, 111719 (2022). https:\/\/doi.org\/10.1016\/j.rser.2021.111719","journal-title":"Renew. Sustain. Energy Rev."},{"key":"621_CR24","doi-asserted-by":"publisher","first-page":"4867","DOI":"10.3390\/app13084867","volume":"13","author":"V Lazari","year":"2023","unstructured":"Lazari, V., Chassiakos, A.: Multi-objective optimization of electric vehicle charging station deployment using genetic algorithms. Appl. Sci. 13, 4867 (2023). https:\/\/doi.org\/10.3390\/app13084867","journal-title":"Appl. Sci."},{"key":"621_CR25","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.3390\/su15032105","volume":"15","author":"S Koohfar","year":"2023","unstructured":"Koohfar, S., Woldemariam, W., Kumar, A.: Prediction of electric vehicles charging demand: a transformer-based deep learning approach. Sustainability 15, 2105 (2023). https:\/\/doi.org\/10.3390\/su15032105","journal-title":"Sustainability"},{"key":"621_CR26","doi-asserted-by":"publisher","first-page":"105213","DOI":"10.1016\/j.cor.2021.105213","volume":"129","author":"H-Y Zhang","year":"2021","unstructured":"Zhang, H.-Y., Chen, Q.X., Smith, J.M., Mao, N., Liao, Y., Xi, S.H.: Queueing network models for intelligent manufacturing units with dual-resource constraints. Comput. Oper. Res. 129, 105213 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105213","journal-title":"Comput. Oper. Res."},{"key":"621_CR27","doi-asserted-by":"publisher","first-page":"1112169","DOI":"10.3389\/fenrg.2023.1112169","volume":"11","author":"D Tang","year":"2023","unstructured":"Tang, D., Liu, X., Zhao, T., Wang, Q.: Spatial\u2013temporal QoS assessment of the EV charging network considering power outages. Front. Energy Res. 11, 1112169 (2023). https:\/\/doi.org\/10.3389\/fenrg.2023.1112169","journal-title":"Front. Energy Res."},{"key":"621_CR28","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1049\/joe.2017.0655","volume":"2017","author":"J Zhu","year":"2017","unstructured":"Zhu, J., Li, Y., Yang, J., Li, X., Zeng, S., Chen, Y.: Planning of electric vehicle charging station based on queuing theory. J. Eng. 2017, 1867\u20131871 (2017). https:\/\/doi.org\/10.1049\/joe.2017.0655","journal-title":"J. Eng."},{"key":"621_CR29","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1177\/0037549717743807","volume":"94","author":"Z Tian","year":"2018","unstructured":"Tian, Z., Hou, W., Gu, X., Gu, F., Yao, B.: The location optimization of electric vehicle charging stations considering charging behavior. SIMULATION 94, 625\u2013636 (2018). https:\/\/doi.org\/10.1177\/0037549717743807","journal-title":"SIMULATION"},{"key":"621_CR30","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.asoc.2018.07.063","volume":"75","author":"D Hu","year":"2019","unstructured":"Hu, D., Zhang, J., Zhang, Q.: Optimization design of electric vehicle charging stations based on the forecasting data with service balance consideration. Appl. Soft Comput. 75, 215\u2013226 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2018.07.063","journal-title":"Appl. Soft Comput."},{"key":"621_CR31","doi-asserted-by":"publisher","first-page":"102769","DOI":"10.1016\/j.trd.2021.102769","volume":"93","author":"M Kavianipour","year":"2021","unstructured":"Kavianipour, M., Fakhrmoosavi, F., Singh, H., Ghamami, M., Zockaie, A., Ouyang, Y., Jackson, R.: Electric vehicle fast charging infrastructure planning in urban networks considering daily travel and charging behavior. Transp. Res. D. 93, 102769 (2021). https:\/\/doi.org\/10.1016\/j.trd.2021.102769","journal-title":"Transp. Res. D."},{"key":"621_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/0471791571","volume-title":"Queueing networks and markov chains: modeling and performance evaluation with computer science applications","author":"G Bolch","year":"2006","unstructured":"Bolch, G., Greiner, S., De Meer, H., Trivedi, K.S.: Queueing networks and markov chains: modeling and performance evaluation with computer science applications. John Wiley & Sons, Hoboken (2006)"},{"key":"621_CR33","unstructured":"Cybermedia Center: http:\/\/www.hpc.cmc.osaka-u.ac.jp\/. Osaka University Cybermedia Center (2022)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-024-00621-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-024-00621-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-024-00621-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T21:06:54Z","timestamp":1757106414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-024-00621-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,14]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["621"],"URL":"https:\/\/doi.org\/10.1007\/s41060-024-00621-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3429105\/v1","asserted-by":"object"}]},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,14]]},"assertion":[{"value":"10 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}