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

A path-based traffic assignment algorithm based on the TRANSYT traffic model

Author

Listed:
  • Wong, S. C.
  • Yang, Chao
  • Lo, Hong K.

Abstract

This paper presents a path-based traffic assignment formulation and its solution algorithm for solving an asymmetric traffic assignment problem based on the TRANSYT traffic model, a well-known procedure to determine the queues and delays in a signal-controlled network with explicit considerations of the signal co-ordination effects and platoon dispersion on the streets. The solution algorithm employs a Frank-Wolfe method to identify the descent direction at each iteration, which requires the input of the derivatives information. A post-simulation sensitivity analysis is developed to estimate the derivatives in the TRANSYT traffic model. Good agreement of results with the values determined by numerical differentiation is obtained. Using these derivatives information, the Frank-Wolfe method shows a good convergence behavior to the equilibrium solution. Comparison with other methods is also discussed in a numerical example to demonstrate the effectiveness of the proposed methodology.

Suggested Citation

  • Wong, S. C. & Yang, Chao & Lo, Hong K., 2001. "A path-based traffic assignment algorithm based on the TRANSYT traffic model," Transportation Research Part B: Methodological, Elsevier, vol. 35(2), pages 163-181, February.
    • Handle: RePEc:eee:transb:v:35:y:2001:i:2:p:163-181
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(99)00044-2
    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. Meneguzzer, Claudio, 1995. "An equilibrium route choice model with explicit treatment of the effect of intersections," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 329-356, October.
    2. 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.
    3. Wong, S. C., 1995. "Derivatives of the performance index for the traffic model from TRANSYT," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 303-327, October.
    4. Wong, S. C., 1996. "Group-based optimisation of signal timings using the TRANSYT traffic model," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 217-244, June.
    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. Josefsson, Magnus & Patriksson, Michael, 2007. "Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 4-31, January.
    2. Jang, Wonjae & Ran, Bin & Choi, Keechoo, 2005. "A discrete time dynamic flow model and a formulation and solution method for dynamic route choice," Transportation Research Part B: Methodological, Elsevier, vol. 39(7), pages 593-620, August.
    3. Liu, Ronghui & Smith, Mike, 2015. "Route choice and traffic signal control: A study of the stability and instability of a new dynamical model of route choice and traffic signal control," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 123-145.
    4. Chen, Anthony & Lo, Hong K. & Yang, Hai, 2001. "A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs," European Journal of Operational Research, Elsevier, vol. 135(1), pages 27-41, November.
    5. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    6. Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
    7. Ying, Jiang Qian & Lu, Huapu & Shi, Jing, 2007. "An algorithm for local continuous optimization of traffic signals," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1189-1197, September.
    8. C. K. Wong & Yi Liu, 2017. "Lane-Based Optimization for Macroscopic Network Configuration Designs," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-18, July.
    9. Chow, Andy H.F. & Lo, Hong K., 2007. "Sensitivity analysis of signal control with physical queuing: Delay derivatives and an application," Transportation Research Part B: Methodological, Elsevier, vol. 41(4), pages 462-477, May.
    10. Michael Patriksson, 2004. "Sensitivity Analysis of Traffic Equilibria," Transportation Science, INFORMS, vol. 38(3), pages 258-281, August.
    11. Luca D’Acierno & Marilisa Botte, 2021. "Railway System Design by Adopting the Merry-Go-Round (MGR) Paradigm," Sustainability, MDPI, vol. 13(4), pages 1-21, February.
    12. Han, Deren & Lo, Hong K., 2004. "Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 159(3), pages 529-544, December.
    13. Wong, C. K. & Wong, S. C., 2003. "Lane-based optimization of signal timings for isolated junctions," Transportation Research Part B: Methodological, Elsevier, vol. 37(1), pages 63-84, January.

    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. Lee, Seunghyeon & Wong, S.C. & Varaiya, Pravin, 2017. "Group-based hierarchical adaptive traffic-signal control Part II: Implementation," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 376-397.
    2. Lee, Seunghyeon & Wong, S.C. & Varaiya, Pravin, 2017. "Group-based hierarchical adaptive traffic-signal control part I: Formulation," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 1-18.
    3. Wong, S. C. & Wong, W. T. & Leung, C. M. & Tong, C. O., 2002. "Group-based optimization of a time-dependent TRANSYT traffic model for area traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 36(4), pages 291-312, May.
    4. Chow, Andy H.F. & Lo, Hong K., 2007. "Sensitivity analysis of signal control with physical queuing: Delay derivatives and an application," Transportation Research Part B: Methodological, Elsevier, vol. 41(4), pages 462-477, May.
    5. Coogan, Samuel & Kim, Eric & Gomes, Gabriel & Arcak, Murat & Varaiya, Pravin, 2017. "Offset optimization in signalized traffic networks via semidefinite relaxation," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 82-92.
    6. Wong, C. K. & Wong, S. C., 2003. "Lane-based optimization of signal timings for isolated junctions," Transportation Research Part B: Methodological, Elsevier, vol. 37(1), pages 63-84, January.
    7. Lee, Seunghyeon & Wong, S.C., 2017. "Group-based approach to predictive delay model based on incremental queue accumulations for adaptive traffic control systems," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 1-20.
    8. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    9. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    10. Cipriani, Ernesto & Fusco, Gaetano, 2004. "Combined signal setting design and traffic assignment problem," European Journal of Operational Research, Elsevier, vol. 155(3), pages 569-583, June.
    11. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    12. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    13. Mylonas, Chrysostomos & Mitsakis, Evangelos & Kepaptsoglou, Konstantinos, 2023. "Criticality analysis in road networks with graph-theoretic measures, traffic assignment, and simulation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 629(C).
    14. Huey‐Kuo Chen & Huey‐Wen Chou, 2008. "Supply chain network equilibrium problem with capacity constraints," Papers in Regional Science, Wiley Blackwell, vol. 87(4), pages 605-621, November.
    15. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    16. Wang, Jian & He, Xiaozheng & Peeta, Srinivas & Wang, Wei, 2022. "Globally convergent line search algorithm with Euler-based step size-determination method for continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 119-144.
    17. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    18. Giulio Cantarella & Antonino Vitetta, 2006. "The multi-criteria road network design problem in an urban area," Transportation, Springer, vol. 33(6), pages 567-588, November.
    19. Ennio Cascetta & Mariano Gallo & Bruno Montella, 2006. "Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models," Annals of Operations Research, Springer, vol. 144(1), pages 301-328, April.
    20. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.

    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:35:y:2001:i:2:p:163-181. 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.