IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v51y2004i2p242-257.html
   My bibliography  Save this article

A fluid queueing model for link travel time moments

Author

Listed:
  • Jeffrey P. Kharoufeh
  • Natarajan Gautam

Abstract

We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004

Suggested Citation

  • Jeffrey P. Kharoufeh & Natarajan Gautam, 2004. "A fluid queueing model for link travel time moments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(2), pages 242-257, March.
    • Handle: RePEc:wly:navres:v:51:y:2004:i:2:p:242-257
    DOI: 10.1002/nav.10114
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10114
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10114?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
    ---><---

    References listed on IDEAS

    as
    1. Fu, Liping & Rilett, L. R., 1998. "Expected shortest paths in dynamic and stochastic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(7), pages 499-516, September.
    2. Joseph Abate & Ward Whitt, 1995. "Numerical Inversion of Laplace Transforms of Probability Distributions," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 36-43, February.
    3. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    4. Harilaos N. Psaraftis & John N. Tsitsiklis, 1993. "Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs," Operations Research, INFORMS, vol. 41(1), pages 91-101, 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. Andrew M. Ross, 2009. "Distribution sensitivity in a highway flow model," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 769-786, November.

    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. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    2. Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
    3. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    4. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    5. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    6. Levering, Nikki & Boon, Marko & Mandjes, Michel & Núñez-Queija, Rudesindo, 2022. "A framework for efficient dynamic routing under stochastically varying conditions," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 97-124.
    7. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    8. Shu, Yin & Feng, Qianmei & Liu, Hao, 2019. "Using degradation-with-jump measures to estimate life characteristics of lithium-ion battery," Reliability Engineering and System Safety, Elsevier, vol. 191(C).
    9. David H Collins & Richard L Warr & Aparna V Huzurbazar, 2013. "An introduction to statistical flowgraph models for engineering systems," Journal of Risk and Reliability, , vol. 227(5), pages 461-470, October.
    10. C. E. Phelan & D. Marazzina & G. Germano, 2020. "Pricing methods for α-quantile and perpetual early exercise options based on Spitzer identities," Quantitative Finance, Taylor & Francis Journals, vol. 20(6), pages 899-918, June.
    11. Harrison, Peter G., 2024. "On the numerical solution of functional equations with application to response time distributions," Applied Mathematics and Computation, Elsevier, vol. 472(C).
    12. Dirk Becherer & Todor Bilarev & Peter Frentrup, 2018. "Optimal liquidation under stochastic liquidity," Finance and Stochastics, Springer, vol. 22(1), pages 39-68, January.
    13. S. Waller & David Fajardo & Melissa Duell & Vinayak Dixit, 2013. "Linear Programming Formulation for Strategic Dynamic Traffic Assignment," Networks and Spatial Economics, Springer, vol. 13(4), pages 427-443, December.
    14. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    15. Svetlana Boyarchenko & Sergei Levendorskiu{i}, 2024. "Efficient inverse $Z$-transform and Wiener-Hopf factorization," Papers 2404.19290, arXiv.org, revised May 2024.
    16. Corsaro, Stefania & Kyriakou, Ioannis & Marazzina, Daniele & Marino, Zelda, 2019. "A general framework for pricing Asian options under stochastic volatility on parallel architectures," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1082-1095.
    17. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    18. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    19. Qu, Yan & Dassios, Angelos & Zhao, Hongbiao, 2021. "Random variate generation for exponential and gamma tilted stable distributions," LSE Research Online Documents on Economics 108593, London School of Economics and Political Science, LSE Library.
    20. Wen, Liang & Çatay, Bülent & Eglese, Richard, 2014. "Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge," European Journal of Operational Research, Elsevier, vol. 236(3), pages 915-923.

    More about this item

    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:wly:navres:v:51:y:2004:i:2:p:242-257. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.