IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v260y2017i3p1043-1068.html
   My bibliography  Save this article

Circulation network design for urban rail transit station using a PH(n)/PH(n)/C/C queuing network model

Author

Listed:
  • Zhu, Juanxiu
  • Hu, Lu
  • Jiang, Yangsheng
  • Khattak, Afaq

Abstract

Width is crucial to the performance of circulation network in urban rail transit station. However, poor performance has been observed in most existing circulation systems. In fact, randomness and state-dependence exist in circulation network where blocking and feedback cannot be ignored. In this paper, we develop a PH(n)/PH(n)/C/C state-dependent queuing network model with an analytical solution. This model describes the random and state-dependent arrival interval as well as service time by phase-type distribution. Feedback is also taken into account. The existing M/M(n)/C/C is a special case of the proposed PH(n)/PH(n)/C/C queuing network model, and the existing M/G(n)/C/C and D/D/1/C models can be approximated by the proposed network model. Then we present a programming formulation for circulation network design with blocking probability control based on the queuing network model. Finally, we illustrate the applicability of the proposed design method by comparing it with the existing design methods. The results show that: 1) the blocking probability is quite small and evenly distributed in the network designed by the new method, while much bigger and fluctuating blocking probabilities exist in networks designed by the other two methods; 2) other performance measures, like area per passenger, dwell time and throughput, are also considerably improved in the new method; 3) performance measures of the proposed method enjoy high performance-cost elasticity compared with the other two methods. An interesting insight is also obtained that the squared coefficient of variation for arrival interval plays an important role in determining the optimal width for circulation network.

Suggested Citation

  • Zhu, Juanxiu & Hu, Lu & Jiang, Yangsheng & Khattak, Afaq, 2017. "Circulation network design for urban rail transit station using a PH(n)/PH(n)/C/C queuing network model," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1043-1068.
  • Handle: RePEc:eee:ejores:v:260:y:2017:i:3:p:1043-1068
    DOI: 10.1016/j.ejor.2017.01.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717300656
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2017.01.030?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. Krishnamoorthy, A. & Babu, S. & Narayanan, Viswanath C., 2009. "The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service," European Journal of Operational Research, Elsevier, vol. 195(1), pages 174-185, May.
    2. Liu, Jialu & Yang, Sheng & Wu, Aiguo & Hu, S. Jack, 2012. "Multi-state throughput analysis of a two-stage manufacturing system with parallel unreliable machines and a finite buffer," European Journal of Operational Research, Elsevier, vol. 219(2), pages 296-304.
    3. MacGregor Smith, J., 1991. "State-dependent queueing models in emergency evacuation networks," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 373-389, December.
    4. Jin, Wen-Long, 2015. "Point queue models: A unified approach," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 1-16.
    5. Masuyama, Hiroyuki, 2011. "Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains," European Journal of Operational Research, Elsevier, vol. 213(3), pages 509-516, September.
    6. Li, Xiang & Lo, Hong K., 2014. "An energy-efficient scheduling and speed control approach for metro rail operations," Transportation Research Part B: Methodological, Elsevier, vol. 64(C), pages 73-89.
    7. Mitchell, David H. & MacGregor Smith, J., 2001. "Topological network design of pedestrian networks," Transportation Research Part B: Methodological, Elsevier, vol. 35(2), pages 107-135, February.
    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. Ryan Palmer & Martin Utley, 2020. "On the modelling and performance measurement of service networks with heterogeneous customers," Annals of Operations Research, Springer, vol. 293(1), pages 237-268, October.
    2. Hu, Lu & Zhao, Bin & Zhu, Juanxiu & Jiang, Yangsheng, 2019. "Two time-varying and state-dependent fluid queuing models for traffic circulation systems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 997-1019.
    3. Afaq Khattak & Hamad Almujibah & Feng Chen & Hussain S. Alyami, 2022. "Modified State-Dependent Queuing Model for the Capacity Analysis of Metro Rail Transit Station Corridor during COVID-19," Sustainability, MDPI, vol. 14(21), pages 1-14, October.
    4. Khattak, Afaq & Hussain, Arshad, 2021. "Hybrid DES-PSO framework for the design of commuters’ circulation space at multimodal transport interchange," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 205-229.

    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. Hu, Lu & Jiang, Yangsheng & Zhu, Juanxiu & Chen, Yanru, 2015. "A PH/PH(n)/C/C state-dependent queuing model for metro station corridor width design," European Journal of Operational Research, Elsevier, vol. 240(1), pages 109-126.
    2. MacGregor Smith, J. & Cruz, F.R.B., 2014. "M/G/c/c state dependent travel time models and properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 560-579.
    3. Albrecht, Amie & Howlett, Phil & Pudney, Peter & Vu, Xuan & Zhou, Peng, 2016. "The key principles of optimal train control—Part 1: Formulation of the model, strategies of optimal type, evolutionary lines, location of optimal switching points," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 482-508.
    4. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    5. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    6. Cheng Gong & Shiwen Zhang & Feng Zhang & Jianguo Jiang & Xinheng Wang, 2014. "An Integrated Energy-Efficient Operation Methodology for Metro Systems Based on a Real Case of Shanghai Metro Line One," Energies, MDPI, vol. 7(11), pages 1-25, November.
    7. Cova, Thomas J. & Johnson, Justin P., 2003. "A network flow model for lane-based evacuation routing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(7), pages 579-604, August.
    8. Li, Shukai & Liu, Ronghui & Gao, Ziyou & Yang, Lixing, 2021. "Integrated train dwell time regulation and train speed profile generation for automatic train operations on high-density metro lines: A distributed optimal control method," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 82-105.
    9. Canca, David & Zarzo, Alejandro, 2017. "Design of energy-Efficient timetables in two-way railway rapid transit lines," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 142-161.
    10. Zhan, Shuguang & Wang, Pengling & Wong, S.C. & Lo, S.M., 2022. "Energy-efficient high-speed train rescheduling during a major disruption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    11. Babak Javani & Abbas Babazadeh, 2020. "Path-Based Dynamic User Equilibrium Model with Applications to Strategic Transportation Planning," Networks and Spatial Economics, Springer, vol. 20(2), pages 329-366, June.
    12. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
    13. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.
    14. Xiaowen Wang & Zhuang Xiao & Mo Chen & Pengfei Sun & Qingyuan Wang & Xiaoyun Feng, 2020. "Energy-Efficient Speed Profile Optimization and Sliding Mode Speed Tracking for Metros," Energies, MDPI, vol. 13(22), pages 1-29, November.
    15. Luan, Xiaojie & Wang, Yihui & De Schutter, Bart & Meng, Lingyun & Lodewijks, Gabriel & Corman, Francesco, 2018. "Integration of real-time traffic management and train control for rail networks - Part 2: Extensions towards energy-efficient train operations," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 72-94.
    16. Bart Steyaert & Sabine Wittevrongel & Herwig Bruneel, 2017. "Characterisation of the output process of a discrete-time GI / D / 1 queue, and its application to network performance," Annals of Operations Research, Springer, vol. 252(1), pages 175-190, May.
    17. Kim, Bara & Kim, Jeongsim, 2012. "A note on the subexponential asymptotics of the stationary distribution of M/G/1 type Markov chains," European Journal of Operational Research, Elsevier, vol. 220(1), pages 132-134.
    18. Jian Zhou & Qina Wang & Chih-Cheng Hung & Fan Yang, 2017. "Credibilistic clustering algorithms via alternating cluster estimation," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 727-738, March.
    19. Qing Han, 2013. "Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm," Future Internet, MDPI, vol. 5(4), pages 1-20, October.
    20. Mo Chen & Zhuang Xiao & Pengfei Sun & Qingyuan Wang & Bo Jin & Xiaoyun Feng, 2019. "Energy-Efficient Driving Strategies for Multi-Train by Optimization and Update Speed Profiles Considering Transmission Losses of Regenerative Energy," Energies, MDPI, vol. 12(18), pages 1-25, September.

    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:eee:ejores:v:260:y:2017:i:3:p:1043-1068. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.