Adaptation of Network Simplex for the Traffic Assignment Problem

Published Online:https://doi.org/10.1287/trsc.2014.0574

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, EnglewoodCliffs, NJ).Google Scholar
  • Bar-Gera H (2002) Origin-based algorithm for the traffic assignment problem. Transportation Sci. 36(4):398–417.LinkGoogle Scholar
  • Bar-Gera H (2010) Traffic assignment by paired alternative segments. Transportation Res. Part B 44(8–9):1022–1046.CrossrefGoogle Scholar
  • Bazaraa MS, Jarvis JJ, Sherali HD (2009) Linear Programming and Network Flows, 4th ed. (John Wiley & Sons, New York).CrossrefGoogle Scholar
  • Bertsekas DP (1976) On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automatic Control 21(2):174–184.CrossrefGoogle Scholar
  • Cunningham WH (1976) A network simplex method. Math. Programming 11(1):105–116.CrossrefGoogle Scholar
  • Dial RB (2006) A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Res. Part B 40(10):917–936.CrossrefGoogle Scholar
  • Gassner BJ (1964) Cycling in the transportation problem. Naval Res. Logist. Quart. 11(1):43–58.CrossrefGoogle Scholar
  • Gibert A (1968) A method for the traffic assignment problem. Report LBS-TNT-95, Transportation Network Theory Unit, London Business School, London.Google Scholar
  • Nguyen S (1974) An algorithm for the traffic assignment problem. Transportation Sci. 8(3):203–216.LinkGoogle Scholar
  • Nguyen S (1976) A unified approach to equilibrium methods for traffic assignment. Florian MA, ed. Traffic Equilibrium Methods (Springer, Berlin Heidelberg), 148–182.CrossrefGoogle Scholar
  • Nie Y (2010) A class of bush-based algorithm for the traffic assignment problem. Transportation Res. Part B 44(1):73–89.CrossrefGoogle Scholar
  • Nie Y (2012) A note on Bar-Gera’s algorithm for the origin-based traffic assignment problem. Transportation Sci. 46(1):27–38.LinkGoogle Scholar
  • Patriksson M (1994) The Traffic Assignment Problem-Models and Algorithms (VSP International Science Publishers, Utrecht, Netherlands).Google Scholar
  • Petersen ER (1975) A primal-dual traffic assignment algorithm. Management Sci. 22(1):87–95.LinkGoogle Scholar
  • Schneur RR, Orlin JB (1998) A scaling algorithm for multicommodity flow problems. Oper. Res. 46(2):231–246.LinkGoogle Scholar
  • Sheffi Y (1984) Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
  • Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers II(1):325–378.CrossrefGoogle Scholar
  • Zangwill WI (1967) The convex simplex method. Management Sci. 14(3):221–238.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.