IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v31y1997i4p277-290.html
   My bibliography  Save this article

Toward a class of link travel time functions for dynamic assignment models on signalized networks

Author

Listed:
  • Ran, Bin
  • Rouphail, Nagui M.
  • Tarko, Andrzej
  • Boyce, David E.

Abstract

This paper investigates time-dependent travel time functions for dynamic assignment on signalized arterial network links. Dynamic link travel times are first classified according to various applications. Subsequently, stochastic and deterministic travel time functions for longer and shorter time horizons are discussed separately, and two sets of functions are recommended for dynamic transportation network problems. The implications of those functional forms are analyzed and some modifications for dynamic network models are suggested. In addition, based on dynamic link travel time functions, we discuss how many independent variables are necessary to describe the temporal traffic flow and properly estimate the time-dependent travel time and flow propagation over an arterial link. As a result, six link flow variables and corresponding link state and flow propagation equations are proposed as the basis to formulate dynamic transportation network models.

Suggested Citation

  • Ran, Bin & Rouphail, Nagui M. & Tarko, Andrzej & Boyce, David E., 1997. "Toward a class of link travel time functions for dynamic assignment models on signalized networks," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 277-290, August.
  • Handle: RePEc:eee:transb:v:31:y:1997:i:4:p:277-290
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(96)00036-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Akçelik, Rahmi & Rouphail, Nagui M., 1993. "Estimation of delays at traffic signals for variable demand conditions," Transportation Research Part B: Methodological, Elsevier, vol. 27(2), pages 109-131, April.
    2. Bin Ran & David E. Boyce & Larry J. LeBlanc, 1993. "A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models," Operations Research, INFORMS, vol. 41(1), pages 192-202, 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. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    2. Lam, William H. K. & Yin, Yafeng, 2001. "An activity-based time-dependent traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 549-574, July.
    3. Chan, K. S. & Lam, William H. K., 2002. "Optimal speed detector density for the network with travel time information," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(3), pages 203-223, March.
    4. Gentile, Guido & Meschini, Lorenzo & Papola, Natale, 2005. "Macroscopic arc performance models with capacity constraints for within-day dynamic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 39(4), pages 319-338, May.
    5. Carey, Malachy & McCartney, Mark, 2002. "Behaviour of a whole-link travel time model used in dynamic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 36(1), pages 83-95, January.
    6. Kachani, Soulaymane & Perakis, Georgia, 2006. "Fluid dynamics models and their applications in transportation and pricing," European Journal of Operational Research, Elsevier, vol. 170(2), pages 496-517, April.
    7. Tam, M. L. & Lam, William H. K., 2000. "Maximum car ownership under constraints of road capacity and parking space," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(3), pages 145-170, April.

    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. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    2. Zhao, Chunxue & Fu, Baibai & Wang, Tianming, 2014. "Braess paradox and robustness of traffic networks under stochastic user equilibrium," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 135-141.
    3. Ran, Bin & Hall, Randolph & Boyce, David E., 1995. "A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt84t190b3, Institute of Transportation Studies, UC Berkeley.
    4. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
    5. Y. W. Xu & J. H. Wu & M. Florian & P. Marcotte & D. L. Zhu, 1999. "Advances in the Continuous Dynamic Network Loading Problem," Transportation Science, INFORMS, vol. 33(4), pages 341-353, November.
    6. 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.
    7. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    8. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    9. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    10. Long, Jiancheng & Szeto, W.Y. & Du, Jie & Wong, R.C.P., 2017. "A dynamic taxi traffic assignment model: A two-level continuum transportation system approach," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 222-254.
    11. Ran, Bin & Hall, Randolph W. & Boyce, David E., 1996. "A link-based variational inequality model for dynamic departure time/route choice," Transportation Research Part B: Methodological, Elsevier, vol. 30(1), pages 31-46, February.
    12. Liu, Yang & Nie, Yu (Marco) & Hall, Jonathan, 2015. "A semi-analytical approach for solving the bottleneck model with general user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 56-70.
    13. Carey, Malachy & Humphreys, Paul & McHugh, Marie & McIvor, Ronan, 2014. "Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 90-104.
    14. Kaufman, David E. & Nonis, Jason & Smith, Robert L., 1998. "A mixed integer linear programming model for dynamic route guidance," Transportation Research Part B: Methodological, Elsevier, vol. 32(6), pages 431-440, August.
    15. Friesz, Terry L. & Han, Ke & Neto, Pedro A. & Meimand, Amir & Yao, Tao, 2013. "Dynamic user equilibrium based on a hydrodynamic model," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 102-126.
    16. Viti, Francesco & van Zuylen, Henk J., 2010. "Probabilistic models for queues at fixed control signals," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 120-135, January.
    17. Jayakrishnan, R. & Tsai, Wei T. & Prashker, Joseph N. & Rajadhyaksha, Subodh, 1994. "A Faster Path-Based Algorithm for Traffic Assignment," University of California Transportation Center, Working Papers qt2hf4541x, University of California Transportation Center.
    18. Carey, Malachy & McCartney, Mark, 2003. "Pseudo-periodicity in a travel-time model used in dynamic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 37(9), pages 769-792, November.
    19. Malachy Carey & Y. E. Ge & Mark McCartney, 2003. "A Whole-Link Travel-Time Model with Desirable Properties," Transportation Science, INFORMS, vol. 37(1), pages 83-96, February.
    20. Raadsen, Mark P.H. & Bliemer, Michiel C.J., 2019. "Steady-state link travel time methods: Formulation, derivation, classification, and unification," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 167-191.

    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:eee:transb:v:31:y:1997:i:4:p:277-290. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.