Advanced search
Publication Cover
Transportation Planning and Technology Volume 39, 2016 - Issue 6
Submit an article Journal homepage
356
Views
0
CrossRef citations to date
0
Altmetric
Articles

A path-based flow formulation for the traffic assignment problem

Caixia LiSchool of Engineering and Information Technology, University of New South Wales, Canberra, ACT, AustraliaCorrespondence[email protected]
,
Sreenatha GopalaraoSchool of Engineering and Information Technology, University of New South Wales, Canberra, ACT, Australia
&
Tapabrata RaySchool of Engineering and Information Technology, University of New South Wales, Canberra, ACT, Australia
Pages 597-611 | Received 10 Apr 2015, Accepted 16 Mar 2016, Published online: 31 May 2016

References

  • Altman, E., T. Basar, and R. Srikant. 2002. “Nash Equilibria for Combined Flow Control and Routing in Networks: Asymptotic Behavior for a Large Number of Users.” IEEE Transactions on Automatic Control 47 (6): 917–930. doi: 10.1109/TAC.2002.1008358
  • Cheng, S-F., M. A. Epelman, and R. L. Smith. 2006. “Cosign: A Parallel Algorithm for Coordinated Traffic Signal Control.” IEEE Transactions on Intelligent Transportation Systems, 7 (4): 551–564. doi: 10.1109/TITS.2006.884617
  • Chow, J. Y. J. 2014. “Activity-Based Travel Scenario Analysis with Routing Problem Reoptimization.” Computer-Aided Civil and Infrastructure Engineering 29 (2): 91–106. doi: 10.1111/mice.12023
  • Friesz, T. L. 2010. Dynamic Optimization and Differential Games. 135 Vols. Berlin: Springer-Verlag.
  • Fukushima, M. 1984. “A modified Frank-Wolfe algorithm for solving the traffic assignment problem”. Transportation Research Part B: Methodological 18 (2): 169–153.
  • Harker, P. T. 1988. “Multiple Equilibrium Behaviors on Networks.” Transportation Science 22 (1): 39–46. doi: 10.1287/trsc.22.1.39
  • Haurie, A., and P. Marcotte. 1985. “On the Relationship Between Nash-Cournot and Wardrop Equilibria.” Networks 15 (3): 295–308. doi: 10.1002/net.3230150303
  • Korilis, Y. A., A. A. Lazar, and A. Orda. 1997. “Achieving Network Optima Using Stackelberg Routing Strategies.” IEEE/ACM Transactions on Networking (TON) 5 (1): 161–173. doi: 10.1109/90.554730
  • Kumar, A., and S. Peeta. 2014. “Strategies to Enhance the Performance of Path-Based Static Traffic Assignment Algorithms.” Computer-Aided Civil and Infrastructure Engineering 29 (5): 330–341. doi: 10.1111/mice.12056
  • La, R. J., and V. Anantharam. 2002. “Optimal Routing Control: Repeated Game Approach.” IEEE Transactions on Automatic Control 47 (3): 437–450. doi: 10.1109/9.989076
  • Sbayti, H., C-C. Lu, and H. S. Mahmassani. 2007. “Efficient Implementation of Method of Successive Averages in Simulation-Based Dynamic Traffic Assignment Models for Large-Scale Network Applications.” Transportation Research Record: Journal of the Transportation Research Board 2029 (1): 22–30. doi: 10.3141/2029-03
  • Sislak, D., P. Volf, and M. Pechoucek. 2011. “Agent-Based Cooperative Decentralized Airplane-Collision Avoidance.” IEEE Transactions on Intelligent Transportation Systems 12 (1): 36–46. doi: 10.1109/TITS.2010.2057246
  • van Vuren, T., D. van Vliet, and M. J. Smith. 1990. “Combined Equilibrium in a Network with Partial Route Guidance.” (In) Traffic Control Methods: Proceedings of the 5th NG Foundation conference, Santa Barbara, CA. https://trid.trb.org/view.aspx?id=353793.
  • Wardrop, J. G. 1952. “Some Theoretical Aspects of Road Traffic Research.” ICE Proceedings: Engineering Division 1: 325–362. Thomas Telford.
  • Wie, B-W. 1993. “A Differential Game Model of Nash Equilibrium on a Congested Traffic Network.” Networks 23 (6): 557–565. doi: 10.1002/net.3230230606
  • Wie, B-W. 1995. “A Differential Game Approach to the Dynamic Mixed Behavior Traffic Network Equilibrium Problem.” European Journal of Operational Research 83 (1): 117–136. doi: 10.1016/0377-2217(93)E0242-P

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.