IDEAS home Printed from https://ideas.repec.org/p/ags/ndtr70/318523.html
   My bibliography  Save this paper

Urban Travel Demand Models and Multi-Modal Traffic Equilibrium

Author

Listed:
  • Florian, Michael

Abstract

No abstract is available for this item.

Suggested Citation

  • Florian, Michael, 1976. "Urban Travel Demand Models and Multi-Modal Traffic Equilibrium," Transportation Research Forum Proceedings 1970s 318523, Transportation Research Forum.
    • Handle: RePEc:ags:ndtr70:318523
    DOI: 10.22004/ag.econ.318523
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/318523/files/agecon-trf-0656.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.318523?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. Dial, Robert B. & Bunyan, Richard E., 1968. "Public transit planning system," Socio-Economic Planning Sciences, Elsevier, vol. 1(3), pages 345-362, July.
    2. Sang Nguyen, 1974. "An Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 8(3), pages 203-216, August.
    3. Stella C. Dafermos, 1971. "An Extended Traffic Assignment Model with Applications to Two-Way Traffic," Transportation Science, INFORMS, vol. 5(4), pages 366-389, November.
    4. T. Leventhal & G. Nemhauser & L. Trotter, 1973. "A Column Generation Algorithm for Optimal Traffic Assignment," Transportation Science, INFORMS, vol. 7(2), pages 168-176, May.
    5. Michael Florian & Sang Nguyen, 1974. "A Method for Computing Network Equilibrium with Elastic Demands," Transportation Science, INFORMS, vol. 8(4), pages 321-332, November.
    Full references (including those not matched with items on IDEAS)

    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. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.
    2. 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.
    3. 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.
    4. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.
    5. 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).
    6. 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.
    7. Jingni Song & Feng Chen & Qunqi Wu & Weiyu Liu & Feiyang Xue & Kai Du, 2019. "Optimization of Passenger Transportation Corridor Mode Supply Structure in Regional Comprehensive Transport Considering Economic Equilibrium," Sustainability, MDPI, vol. 11(4), pages 1-18, February.
    8. Wang, Dong & Liao, Feixiong, 2023. "Incentivized user-based relocation strategies for moderating supply–demand dynamics in one-way car-sharing services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    9. Andrea Raith & Judith Wang & Matthias Ehrgott & Stuart Mitchell, 2014. "Solving multi-objective traffic assignment," Annals of Operations Research, Springer, vol. 222(1), pages 483-516, November.
    10. Frédéric Babonneau & Jean-Philippe Vial, 2008. "An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands," Transportation Science, INFORMS, vol. 42(2), pages 249-260, May.
    11. Liu, Haoxiang & Wang, David Z.W., 2017. "Locating multiple types of charging facilities for battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 30-55.
    12. Liu, Zhiyuan & Chen, Xinyuan & Hu, Jintao & Wang, Shuaian & Zhang, Kai & Zhang, Honggang, 2023. "An alternating direction method of multipliers for solving user equilibrium problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1072-1084.
    13. 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.
    14. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Rasouli, Soora & Huang, Hai-Jun, 2020. "Tolerance-based column generation for boundedly rational dynamic activity-travel assignment in large-scale networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    15. 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.
    16. Yu (Marco) Nie, 2012. "A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem," Transportation Science, INFORMS, vol. 46(1), pages 27-38, February.
    17. Vo, Khoa D. & Lam, William H.K. & Chen, Anthony & Shao, Hu, 2020. "A household optimum utility approach for modeling joint activity-travel choices in congested road networks," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 93-125.
    18. Perederieieva, Olga & Raith, Andrea & Schmidt, Marie, 2018. "Non-additive shortest path in the context of traffic assignment," European Journal of Operational Research, Elsevier, vol. 268(1), pages 325-338.
    19. Jahn, Olaf & Möhring, Rolf & Schulz, Andreas & Stier Moses, Nicolás, 2004. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Working papers 4394-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    20. Liu, Peng & Liao, Feixiong & Tian, Qiong & Huang, Hai-Jun & Timmermans, Harry, 2020. "Day-to-day needs-based activity-travel dynamics and equilibria in multi-state supernetworks," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 208-227.

    More about this item

    Keywords

    Public Economics;

    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:ags:ndtr70:318523. 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: AgEcon Search (email available below). General contact details of provider: http://www.trforum.org/journal/ .

    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.