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

Primal Method for Determining the Most Likely Route Flows in Large Road Networks

Author

Listed:
  • Hillel Bar-Gera

    (Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Be’er-Sheva 84105, Israel)

Abstract

This paper presents a method to identify the set of routes and their flows in a user-equilibrium traffic assignment solution. We present a general consistency condition that is satisfied by any set of minimum-cost routes, and show how it can be used in choosing a set of routes that is likely to be similar to the set of user-equilibrium routes. The proposed consistency condition is also essential for finding the entropy-maximizing route flows solution, which may be regarded as the most likely one. An efficient method for finding the entropy-maximizing solution is presented. Numerical results on several networks, including one of large scale, demonstrate the effectiveness of the proposed method. In most cases the method achieves a duality gap of practically zero in a short computation time.

Suggested Citation

  • Hillel Bar-Gera, 2006. "Primal Method for Determining the Most Likely Route Flows in Large Road Networks," Transportation Science, INFORMS, vol. 40(3), pages 269-286, August.
    • Handle: RePEc:inm:ortrsc:v:40:y:2006:i:3:p:269-286
    DOI: 10.1287/trsc.1050.0142
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1050.0142
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1050.0142?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. Harris, Britton, 2002. "Multiple paths through a network," ERSA conference papers ersa02p138, European Regional Science Association.
    2. Janson, Bruce N., 1993. "Most likely origin-destination link uses from equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 27(5), pages 333-350, October.
    3. Boyce David & Xiong Qian, 2004. "User-Optimal and System-Optimal Route Choices for a Large Road Network," Review of Network Economics, De Gruyter, vol. 3(4), pages 1-10, December.
    4. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, 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. Gaudry, Marc, 2018. "The utility of journeys, from Dupuit's constant-time bridge crossing hops to commutes of chosen duration and reliability in the Paris region," Transport Policy, Elsevier, vol. 70(C), pages 53-68.
    2. Jun Xie & Yu (Marco) Nie, 2019. "A New Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment," Transportation Science, INFORMS, vol. 53(2), pages 566-584, March.
    3. Marc Gaudry & Emile Quinet, 2012. "Shannon's measure of information, path averages and the origins of random utility models in transport itinerary or mode choice analysis," PSE Working Papers halshs-00713168, HAL.
    4. Jafari, Ehsan & Boyles, Stephen D., 2016. "Improved bush-based methods for network contraction," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 298-313.
    5. Wen-yi Zhang & Wei Guan & Ji-hui Ma & Jun-fang Tian, 2015. "A Nonlinear Pairwise Swapping Dynamics to Model the Selfish Rerouting Evolutionary Game," Networks and Spatial Economics, Springer, vol. 15(4), pages 1075-1092, December.
    6. Bar-Gera, Hillel & Boyce, David & Nie, Yu (Marco), 2012. "User-equilibrium route flows and the condition of proportionality," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 440-462.
    7. Prateek Bansal & Rohan Shah & Stephen D. Boyles, 2018. "Robust network pricing and system optimization under combined long-term stochasticity and elasticity of travel demand," Transportation, Springer, vol. 45(5), pages 1389-1418, September.
    8. O'Hare, Steven J. & Connors, Richard D. & Watling, David P., 2016. "Mechanisms that govern how the Price of Anarchy varies with travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 55-80.
    9. Kumar, Amit & Peeta, Srinivas, 2015. "Entropy weighted average method for the determination of a single representative path flow solution for the static user equilibrium traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 213-229.
    10. He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
    11. Louis Grange & Felipe González & Shlomo Bekhor, 2017. "Path Flow and Trip Matrix Estimation Using Link Flow Density," Networks and Spatial Economics, Springer, vol. 17(1), pages 173-195, March.
    12. Xie, Jun & (Marco) Nie, Yu & Liu, Xiaobo, 2017. "Testing the proportionality condition with taxi trajectory data," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 583-601.
    13. Florian, Michael & Morosan, Calin D., 2014. "On uniqueness and proportionality in multi-class equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 173-185.
    14. Xie, Chi, 2016. "New insights and improvements of using paired alternative segments for traffic assignmentAuthor-Name: Xie, Jun," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 406-424.
    15. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    16. Jiayang Li & Qianni Wang & Liyang Feng & Jun Xie & Yu Marco Nie, 2024. "A Day-to-Day Dynamical Approach to the Most Likely User Equilibrium Problem," Papers 2401.08013, arXiv.org.
    17. Xie, Chi & Kockelman, Kara M. & Waller, S. Travis, 2011. "A maximum entropy-least squares estimator for elastic origin–destination trip matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1465-1482.
    18. Rinaldi, Marco & Tampère, Chris M.J. & Viti, Francesco, 2018. "On characterizing the relationship between route choice behaviour and optimal traffic control solution space," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 892-906.
    19. Li, Tao & Wan, Yan, 2019. "Estimating the geographic distribution of originating air travel demand using a bi-level optimization model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 267-291.
    20. Borchers, Marlies & Breeuwsma, Paul & Kern, Walter & Slootbeek, Jaap & Still, Georg & Tibben, Wouter, 2015. "Traffic user equilibrium and proportionality," Transportation Research Part B: Methodological, Elsevier, vol. 79(C), pages 149-160.
    21. Boyce, David, 2007. "Future research on urban transportation network modeling," Regional Science and Urban Economics, Elsevier, vol. 37(4), pages 472-481, July.
    22. Marc Gaudry & Emile Quinet, 2012. "Shannon's measure of information, path averages and the origins of random utility models in transport itinerary or mode choice analysis," Working Papers halshs-00713168, HAL.
    23. Eikenbroek, Oskar A.L. & Still, Georg J. & van Berkum, Eric C. & Kern, Walter, 2018. "The Boundedly Rational User Equilibrium: A parametric analysis with application to the Network Design Problem," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 1-17.
    24. Lu, Shu & (Marco) Nie, Yu, 2010. "Stability of user-equilibrium route flow solutions for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 609-617, May.
    25. Jafari, Ehsan & Pandey, Venktesh & Boyles, Stephen D., 2017. "A decomposition approach to the static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 270-296.

    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. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    2. Jun Xie & Yu (Marco) Nie, 2019. "A New Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment," Transportation Science, INFORMS, vol. 53(2), pages 566-584, March.
    3. 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).
    4. Jafari, Ehsan & Pandey, Venktesh & Boyles, Stephen D., 2017. "A decomposition approach to the static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 270-296.
    5. 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.
    6. Wang, Xiaolei & Wang, Jun & Guo, Lei & Liu, Wei & Zhang, Xiaoning, 2021. "A convex programming approach for ridesharing user equilibrium under fixed driver/rider demand," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 33-51.
    7. Castillo, Enrique & Menéndez, José María & Jiménez, Pilar, 2008. "Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 455-481, June.
    8. Xie, Jun & Nie, Yu (Marco) & Yang, Xiaoguang, 2013. "Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 15-30.
    9. Jaller, Miguel & Pahwa, Anmol & Zhang, Michael, 2021. "Cargo Routing and Disadvantaged Communities," Institute of Transportation Studies, Working Paper Series qt9qg2318x, Institute of Transportation Studies, UC Davis.
    10. 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).
    11. 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.
    12. Saeed Asadi Bagloee & Majid Sarvi & Avishai Ceder, 2017. "Transit priority lanes in the congested road networks," Public Transport, Springer, vol. 9(3), pages 571-599, October.
    13. Maria Mitradjieva & Per Olov Lindberg, 2013. "The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment ," Transportation Science, INFORMS, vol. 47(2), pages 280-293, May.
    14. Xie, Chi & Kockelman, Kara M. & Waller, S. Travis, 2011. "A maximum entropy-least squares estimator for elastic origin–destination trip matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1465-1482.
    15. Casello, Jeffrey M., 2007. "Transit competitiveness in polycentric metropolitan regions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(1), pages 19-40, January.
    16. 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.
    17. Rinaldi, Marco & Tampère, Chris M.J. & Viti, Francesco, 2018. "On characterizing the relationship between route choice behaviour and optimal traffic control solution space," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 892-906.
    18. Kumar, Amit & Peeta, Srinivas, 2015. "Entropy weighted average method for the determination of a single representative path flow solution for the static user equilibrium traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 213-229.
    19. Xie, Chi & Travis Waller, S., 2012. "Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1023-1042.
    20. 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.

    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:40:y:2006:i:3:p:269-286. 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.