IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v38y2004i1p97-106.html
   My bibliography  Save this article

Deriving Link Travel-Time Distributions via Stochastic Speed Processes

Author

Listed:
  • Jeffrey P. Kharoufeh

    (Department of Operational Sciences, Air Force Institute of Technology, AFIT/ENS, 2950 Hobson Way, Wright-Patterson AFB, Ohio 45433-7765)

  • Natarajan Gautam

    (Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 310 Leonhard Building, University Park, Pennsylvania 16802)

Abstract

We derive an analytical expression for the cumulative distribution function of travel time for a vehicle traversing a freeway link of arbitrary length. The vehicle's speed is assumed to be modulated by a random environment that can be modeled as a stochastic process. We first present a partial differential equation (PDE) describing the travel time distribution and obtain a solution in terms of Laplace transforms. Next, we present a numerical inversion algorithm to invert the transforms. The technique is demonstrated on two example problems. Numerical results indicate great promise for this approach to the link travel-time problem.

Suggested Citation

  • Jeffrey P. Kharoufeh & Natarajan Gautam, 2004. "Deriving Link Travel-Time Distributions via Stochastic Speed Processes," Transportation Science, INFORMS, vol. 38(1), pages 97-106, February.
    • Handle: RePEc:inm:ortrsc:v:38:y:2004:i:1:p:97-106
    DOI: 10.1287/trsc.1030.0048
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1030.0048
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1030.0048?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. Rajat Jain & J. Macgregor Smith, 1997. "Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models," Transportation Science, INFORMS, vol. 31(4), pages 324-336, November.
    2. Coifman, Benjamin, 2002. "Estimating travel times and vehicle trajectories on freeways using dual loop detectors," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(4), pages 351-364, May.
    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. H. Frank, 1969. "Shortest Paths in Probabilistic Graphs," Operations Research, INFORMS, vol. 17(4), pages 583-599, August.
    5. Joseph Abate & Gagan L. Choudhury & Ward Whitt, 1996. "On the Laguerre Method for Numerically Inverting Laplace Transforms," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 413-427, November.
    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. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
    2. 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.
    3. Zhaoqi Zang & Xiangdong Xu & Kai Qu & Ruiya Chen & Anthony Chen, 2022. "Travel time reliability in transportation networks: A review of methodological developments," Papers 2206.12696, arXiv.org, revised Jul 2022.
    4. Hu Shao & William Lam & Mei Tam, 2006. "A Reliability-Based Stochastic Traffic Assignment Model for Network with Multiple User Classes under Uncertainty in Demand," Networks and Spatial Economics, Springer, vol. 6(3), pages 173-204, September.
    5. Vodopivec, Neža & Miller-Hooks, Elise, 2017. "An optimal stopping approach to managing travel-time uncertainty for time-sensitive customer pickup," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 22-37.
    6. Saif Eddin Jabari & Nikolaos M. Freris & Deepthi Mary Dilip, 2020. "Sparse Travel Time Estimation from Streaming Data," Transportation Science, INFORMS, vol. 54(1), pages 1-20, January.
    7. LECLUYSE, C. & VAN WOENSEL, Tom & PEREMANS, Herbert, 2007. "Vehicle routing with stochastic time-dependent travel times," Working Papers 2007018, University of Antwerp, Faculty of Business and Economics.
    8. Yeon, Jiyoun & Elefteriadou, Lily & Lawphongpanich, Siriphong, 2008. "Travel time estimation on a freeway using Discrete Time Markov Chains," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 325-338, May.
    9. 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.

    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. 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.
    2. Arthur Flajolet & Sébastien Blandin & Patrick Jaillet, 2018. "Robust Adaptive Routing Under Uncertainty," Operations Research, INFORMS, vol. 66(1), pages 210-229, January.
    3. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.
    4. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.
    5. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    6. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
    7. Liu, Yang & Blandin, Sebastien & Samaranayake, Samitha, 2019. "Stochastic on-time arrival problem in transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 122-138.
    8. Taesung Hwang & Yanfeng Ouyang, 2015. "Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations," Sustainability, MDPI, vol. 7(6), pages 1-16, May.
    9. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.
    10. David Corredor-Montenegro & Nicolás Cabrera & Raha Akhavan-Tabatabaei & Andrés L. Medaglia, 2021. "On the shortest $$\alpha$$ α -reliable path problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 287-318, April.
    11. Yu Nie & Xing Wu & Tito Homem-de-Mello, 2012. "Optimal Path Problems with Second-Order Stochastic Dominance Constraints," Networks and Spatial Economics, Springer, vol. 12(4), pages 561-587, December.
    12. Arun Prakash, A., 2020. "Algorithms for most reliable routes on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 202-220.
    13. 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.
    14. Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
    15. Wu, Xing, 2015. "Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 275-290.
    16. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
    17. 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.
    18. Dimitris Bertsimas & Arthur Delarue & Patrick Jaillet & Sébastien Martin, 2019. "Travel Time Estimation in the Age of Big Data," Operations Research, INFORMS, vol. 67(2), pages 498-515, March.
    19. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    20. Pedro Cesar Lopes Gerum & Andrew Reed Benton & Melike Baykal-Gürsoy, 2019. "Traffic density on corridors subject to incidents: models for long-term congestion management," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 795-831, December.

    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:inm:ortrsc:v:38:y:2004:i:1:p:97-106. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.