IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v17y2025i7p302-d1695946.html
   My bibliography  Save this article

The Investigation of Queuing Models to Calculate Journey Times to Develop an Intelligent Transport System for Smart Cities

Author

Listed:
  • Vatsal Mehta

    (Department of Design, Engineering and Mathematics, Middlesex University, The Burroughs, Hendon NW4 4BT, UK)

  • Glenford Mapp

    (Department of Computer Science, Middlesex University, The Burroughs, Hendon NW4 4BT, UK)

  • Vaibhav Gandhi

    (Department of Design, Engineering and Mathematics, Middlesex University, The Burroughs, Hendon NW4 4BT, UK
    Current address: Computer Science, University of Southampton Delhi, Gurugram 122101, Haryana, India.)

Abstract

Intelligent transport systems are a major component of smart cities because their deployment should result in reduced journey times, less traffic congestion and a significant reduction in road deaths, which will greatly improve the quality of life of their citizens. New technologies such as vehicular networks allow more information be available in realtime, and this information can be used with new analytical models to obtain more accurate estimates of journey times. This would be extremely useful to drivers and will also enable transport authorities to optimise the transport network. This paper addresses these issues using a model-based approach to provide a new way of estimating the delay along specified routes. A journey is defined as the traversal of several road links and junctions from source to destination. The delay at the junctions is analysed using the zero-server Markov chain technique. This is then combined with the Jackson network to analyse the delay across multiple junctions. The delay at road links is analysed using an M/M/K/K model. The results were validated using two simulators: SUMO and VISSIM. A real scenario is also examined to determine the best route. The preliminary results of this model-based analysis look promising but more work is needed to make it useful for wide-scale deployment.

Suggested Citation

  • Vatsal Mehta & Glenford Mapp & Vaibhav Gandhi, 2025. "The Investigation of Queuing Models to Calculate Journey Times to Develop an Intelligent Transport System for Smart Cities," Future Internet, MDPI, vol. 17(7), pages 1-22, July.
    • Handle: RePEc:gam:jftint:v:17:y:2025:i:7:p:302-:d:1695946
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/17/7/302/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/17/7/302/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Naishuo Tian & Zhe George Zhang, 2006. "Vacation Queueing Models Theory and Applications," International Series in Operations Research and Management Science, Springer, number 978-0-387-33723-4, 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. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    2. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    3. Manickam Vadivukarasi & Kaliappan Kalidass, 2021. "Discussion on the transient behavior of single server Markovian multiple variant vacation queues," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(1), pages 123-146.
    4. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    5. Yuying Zhang & Dequan Yue & Wuyi Yue, 2022. "A queueing-inventory system with random order size policy and server vacations," Annals of Operations Research, Springer, vol. 310(2), pages 595-620, March.
    6. Houyuan Jiang & Zhan Pang & Sergei Savin, 2012. "Performance-Based Contracts for Outpatient Medical Services," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 654-669, October.
    7. Shan Gao & Zaiming Liu & Qiwen Du, 2014. "Discrete-Time Gix/Geo/1/N Queue With Working Vacations And Vacation Interruption," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(01), pages 1-22.
    8. Wee Meng Yeo & Xue-Ming Yuan & Joyce Mei Wan Low, 2017. "On $$M^{X}/G(M/H)/1$$ M X / G ( M / H ) / 1 retrial system with vacation: service helpline performance measurement," Annals of Operations Research, Springer, vol. 248(1), pages 553-578, January.
    9. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.
    10. Pengfei Guo & Zhe George Zhang, 2013. "Strategic Queueing Behavior and Its Impact on System Performance in Service Systems with the Congestion-Based Staffing Policy," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 118-131, September.
    11. Jianjun Li & Liwei Liu & Tao Jiang, 2018. "Analysis of an M/G/1 queue with vacations and multiple phases of operation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 51-72, February.
    12. Ambika, K. & Vijayashree, K.V. & Janani, B., 2024. "Modelling and analysis of production management system using vacation queueing theoretic approach," Applied Mathematics and Computation, Elsevier, vol. 479(C).
    13. Achyutha Krishnamoorthy & Anu Nuthan Joshua & Dmitry Kozyrev, 2021. "Analysis of a Batch Arrival, Batch Service Queuing-Inventory System with Processing of Inventory While on Vacation," Mathematics, MDPI, vol. 9(4), pages 1-29, February.
    14. Anis Chettouf & Amina Angelika Bouchentouf & Mohamed Boualem, 2024. "A Markovian Queueing Model for Telecommunications Support Center with Breakdowns and Vacation Periods," SN Operations Research Forum, Springer, vol. 5(1), pages 1-26, March.
    15. Srinivas R. Chakravarthy & Serife Ozkar, 2016. "Crowdsourcing and Stochastic Modeling," Business and Management Research, Business and Management Research, Sciedu Press, vol. 5(2), pages 19-30, June.
    16. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    17. Veena Goswami & Gopinath Panda, 2024. "Analysis of Renewal Batch Arrival Queues with Multiple Vacations and Geometric Abandonment," Methodology and Computing in Applied Probability, Springer, vol. 26(2), pages 1-27, June.
    18. A. D. Banik & M. L. Chaudhry, 2017. "Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 140-151, February.
    19. Kuo-Hsiung Wang & Cheng-Dar Liou & Ya-Lin Wang, 2014. "Profit optimisation of the multiple-vacation machine repair problem using particle swarm optimisation," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(8), pages 1769-1780, August.
    20. Shunfu Jin & Xiuchen Qie & Wenjuan Zhao & Wuyi Yue & Yutaka Takahashi, 2020. "A clustered virtual machine allocation strategy based on a sleep-mode with wake-up threshold in a cloud environment," Annals of Operations Research, Springer, vol. 293(1), pages 193-212, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jftint:v:17:y:2025:i:7:p:302-:d:1695946. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.