System-optimal routing of traffic flows with user constraints in networks with congestion

Operations Research

Volumn 53, Issue 4, 2005, Pages 600-616

  Jahn, Olaf ^a   Möhring, Rolf H ^b   Schulz, Andreas S ^c   Stier Moses, Nicolás E ^d  

^a Infopark AG   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Howard Hughes Medical Institute   (United States)

Author keywords

Mathematics: combinatorics; Multicommodity: theory; Networks graphs; Transportation: models

Indexed keywords

MATHEMATICS: COMBINATORICS; MULTICOMMODITY: THEORY; NETWORKS/GRAPHS; TRANSPORTATION: MODELS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; GRAPH THEORY; INTEGRATION; MATHEMATICAL MODELS; ROUTERS; USER INTERFACES;

TELECOMMUNICATION TRAFFIC;

EID: 24944546880     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1040.0197     Document Type: Article

References (73)

1. Aneja, Y. P., K. P. K. Nair 1978. The constrained shortest path problem. Naval Res. Logist. Quart. 25 549-555.
2. Aneja, Y. P., V. Aggarwal, K. P. K. Nair. 1983. Shortest chain subject to side constraints. Networks 13 295-302.
3. Arezki, Y., D. Van Vliet. 1990. A full analytical implementation of the Partan/Frank-Wolfe algorithm for equilibrium assignment. Transportation Sci. 24 58-62.
4. Bar-Gera, H. 2002. Transportation Network Test Problems. http://www.bgu.ac.il/~bargera/tntp/.
5. Beccana, G., A. Bolelli. 1992. Modelling and assessment of dynamic route guidance: The MARGOT project. L. Olaussen, E. Helli, eds. Proc. 3rd IEEE Vehicle Navigation and Information Systems Conf. Oslo, Norway, 117-126.
6. Beckmann, M. J., C. B. McGuire, C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
7. Ben-Akiva, M. E. 1985. Dynamic network equilibrium research. Transportation Res. 19A 429-431.
8. Ben-Akiva, M. E., E. Cascetta, H. Gunn. 1995. An on-line dynamic traffic prediction model for an inter-urban motorway network. N. H. Gartner, G. Improta, eds. Urban Traffic Networks. Dynamic Flow Modeling and Control. Springer, Berlin, Germany, 83-122.
9. Ben-Akiva, M. E., A. de Palma, I. A. Kaysi. 1996. The impact of predictive information on guidance efficiency: An analytical approach. L. Bianco, P. Toth, eds. Advanced Methods in Transportation Analysis. Springer, Berlin, Germany, 413-432.
10. Ben-Akiva, M. E., M. Bierlaire, J. Bottom, H. N. Koutsopoulos, R. G. Mishalani. 1997. Development of a route guidance generation system for real-time application. M. Papageorgiou, A. Pouliezos, eds. Proc. 8th IFAC Sympos. on Transportation Systems. Elsevier Science, Oxford, UK, 405-410.
11. Bernstein, D., T. E. Smith. 1994. Equilibria for networks with lower semicontinuous costs: With an application to congestion pricing. Transportation Sci. 28 221-235.
12. Bottom, J. A. 2000. Consistent anticipatory route guidance. Ph.D. thesis, Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA.
13. Braess, D. 1968. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12 258-268.
14. Branston, D. 1976. Link capacity functions: A review. Transportation Res. 10 223-236.
15. Bureau of Public Roads. 1964. Traffic assignment manual. U.S. Department of Commerce, Urban Planning Division, Washington, DC.
16. Charnes, A., W. W. Cooper. 1961. Multicopy traffic network models. R. Herman, ed. Proc. Symposium on the Theory of Traffic Flow. General Motors Research Laboratories, Warren, MI, 1959. Elsevier, Amsterdam, The Netherlands, 85-96.
17. Chen, K., S. E. Underwood. 1991. Research on anticipatory route guidance. Proc. IEEE Vehicle Navigation and Information Systems Conf., Vol. 1. Society of Automotive Engineers, Warrendale, PA, 427-439.
18. Chou, Y.-L., H. E. Romeijn, R. L. Smith. 1998. Approximating shortest paths in large-scale networks with an application to intelligent transportation systems. INFORMS J. Comput. 10 163-179.
19. Climaco, J. C. N., E. Q. V. Martins. 1982. A bicriterion shortest path algorithm. Eur: J. Oper. Res. 11 399-404.
20. Cohen, S. 1991. Flow variables. M. Papageorgiou, ed. Concise Encyclopedia of Traffic and Transportation Systems. Pergamon Press, Oxford, UK, 139-143.
21. Correa, J. R., A. S. Schulz, N. E. Stier-Moses. 2004. Computational complexity, fairness, and the price of anarchy of the maximum latency problem. D. Bienstock, G. Nemhauser, eds. Proc. 10th Conf. on Integer Programming and Combinatorial Optim. (IPCO). Lecture Notes in Computer Science, Vol. 3064. Springer, Heidelberg, Germany, 59-73.
22. Dafermos, S. C., F. T. Sparrow. 1969. The traffic assignment problem for a general network. J. Res. National Bureau Standards 73B 91-118.
23. Daganzo, C. F. 1977a. On the traffic assignment problem with flow dependent costs - I. Transportation Res. 11 433-437.
24. Daganzo, C. F. 1977b. On the traffic assignment problem with flow dependent costs-II. Transportation Res. 11 439-441.
25. DynaMIT. 2002. DynaMIT/DynaMIT-P (v 0.9) User's Manual. Intelligent Transportation Systems Program, Massachusetts Institute of Technology, Cambridge, MA.
26. Dynasmart. 2002. Dynasmart-P (v 0.9) User's Guide. Center for Transportation Research, University of Texas, Austin, TX.
27. Ferris, M. C., A. Ruszczyński. 2000. Robust path choice and vehicle guidance in networks with failures. Networks 35 181-194.
28. Florian, M., D. W. Hearn. 1995. Network equilibrium models and algorithms. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8, Chapter 6. Elsevier, New York, 485-550.
29. Florian, M., J. Guélat, H. Spiess. 1987. An efficient implementation of the "Partan" variant of the linear approximation method for the network equilibrium problem. Networks 17 319-339.
30. Frank, M., P. Wolfe. 1956. An algorithm for quadratic programming. Naval Res. Logist. Quart. 3 95-110.
31. Friesz, T. L. 1985. Transportation network equilibrium, design and aggregation: Key development and research opportunities. Transportation Res. 19A 413-427.
32. Friesz, T. L., D. E. Bernstein, T. E. Smith, R. L. Tobin, B.-W. Wie. 1993. A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41 179-191.
33. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
34. Gibert, A. 1968. A method for the traffic assignment problem. Technical report LBS-TNT-95, Transportation Network Theory Unit, London Business School, London, UK.
35. Hagstrom, J. N., R. A. Abrams. 2001. Characterizing Braess's paradox for traffic networks. Proc. IEEE Conf. on Intelligent Transportation Systems. IEEE Computer Society Press, Los Alamitos, CA, 836-842.
36. Hearn, D. W. 1980. Bounding flows in traffic assignment models. Technical report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
37. Hearn, D. W., M. V. Ramana. 1998. Solving congestion toll pricing models. P. Marcotte, S. Nguyen, eds. Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers, Boston, MA, 109-124.
38. Hearn, D. W., J. Ribera. 1980. Bounded flow equilibrium problems by penalty methods. Proc. IEEE Internat. Conf. on Circuits and Comput., Vol. 1. Institute of Electrical and Electronics Engineers, New York, 162-166.
39. Hearn, D. W., J. Ribera. 1981. Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems. Transportation Res. 15B 437-442.
40. Henry, J. J., C. Charbonnier, J. L. Farges. 1991. Route guidance, individual. M. Papageorgiou, ed. Concise Encyclopedia of Traffic and Transportation Systems. Pergamon Press, Oxford, UK, 417-422.
41. Holmberg, K., D. Yuan. 2003. A multicommodity network-flow problem with side constraints on paths solved by column generation. INFORMS J. Comput. 15 42-57.
42. Jahn, O., R. H. Möhring, A. S. Schulz, N. E. Stier-Moses. 2002. System-optimal routing of traffic flows with user constraints in networks with congestion. Technical report 754-2002, Institut für Mathematik, Technische Universität Berlin, Berlin, Germany.
43. Jorgensen, N. O. 1963. Some aspects of the urban traffic assignment problem. Master's thesis, Institute of Transportation and Traffic Engineering, University of California, Berkeley, CA.
44. Kaufman, D. E., R. L. Smith, K. E. Wunderlich. 1991. An iterative routing/assignment method for anticipatory real-time route guidance. Proc. IEEE Vehicle. Navigation and Information Systems Conf., Vol. 2. Society of Automotive Engineers, Warrendale, PA, 693-700.
45. Kaysi, I. A., M. E. Ben-Akiva, A. de Palma. 1995. Design aspects of advanced traveler information systems. N. H. Gartner, G. Improta, eds. Urban Traffic Networks. Dynamic Flow Modeling and Control. Springer, Berlin, Germany, 59-81.
46. Kaysi, I. A., M. E. Ben-Akiva, H. N. Koutsopoulos. 1993. Integrated approach to vehicle routing and congestion prediction for real-time driver guidance. Transportation Res. Record 1408 66-74.
47. Lafortune, S., R. Sengupta, D. E. Kaufman, R. L. Smith. 1991. A dynamical system model for traffic assignment in networks. Proc. IEEE Vehicle Navigation and Information Systems Conf., Vol. 2. Society of Automotive Engineers, Warrendale, PA, 701-708.
48. Larsson, T., M. Patriksson. 1994. Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models. Le Matematiche 49 249-280.
49. Larsson, T., M. Patriksson. 1995. An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems. Transportation Res. 29B 433-455.
50. Larsson, T., M. Patriksson. 1999. Side constrained traffic equilibrium models - analysis, computation and applications. Transportation Res. 33B 233-264.
51. LeBlanc, L. J., R. V. Helgason, D. E. Boyce. 1985. Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transportation Sci. 19 445-462.
52. Leventhal, T., G. Nemhauser, L. Trotter. 1973. A column generation algorithm for optimal traffic assignment. Transportation Sci. 7 168-176.
53. Magnanti, T. L. 1984. Models and algorithms for predicting urban traffic equilibria. M. Florian, ed. Transportation Planning Models. Proceedings of course at International Center for Transportation Studies (ICTS). North Holland, Amsterdam, The Netherlands, 153-185.
54. Mahmassani, H. S., S. Peeta. 1993. Network performance under system optimal and user equilibrium dynamic assignments: Implications for advanced traveler information systems. Transportation Res. Record 1408 83-93.
55. Mahmassani, H. S., S. Peeta. 1995. System optimal dynamic assignment for electronic route guidance in a congested traffic network. N. H. Gartner, G. Improta, eds. Urban Traffic Networks. Dynamic Flow Modeling and Control. Springer, Berlin, Germany, 3-37.
56. Mahmassani, H. S., T.-Y. Hu, S. Peeta, A. Ziliaskopoulos. 1994. Development and testing of dynamic traffic assignment and simulation procedures for ATIS/ATMS applications. Technical report DTFH61-90-R-0074-FG, Center for Transportation Research, University of Texas, Austin, TX.
57. Mehlhorn, K., M. Ziegelmann. 2000. Resource constrained shortest paths. M. Paterson, ed. Proc. 8th Annual Eur. Sympos. on Algorithms (ESA). Lecture Notes in Computer Science, Vol. 1879. Springer, Heidelberg, Germany, 326-337.
58. Merchant, D. K., G. L. Nemhauser. 1978. A model and an algorithm for the dynamic traffic assignment problems. Transportation Sci. 12 183-199.
59. Nagurney, A. 1993. Network Economics: A Variational Inequality Approach. Kluwer Academic Publishers, Boston, MA.
60. Papageorgiou, M. 1990. Dynamic modeling, assignment, and route guidance in traffic networks. Transportation Res. 24B 471-496.
61. Patriksson, M. 1994. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands.
62. Peeta, S., A. K. Ziliaskopoulos. 2001. Foundations of dynamic traffic assignment: The past, the present and the future. Networks Spatial Econom. 1 233-265.
63. Ribeiro, C., M. Minoux. 1986. Solving hard constrained shortest path problems by Lagrangean relaxation and branch-and-bound algorithms. Methods Oper. Res. 53 303-316.
64. Roughgarden, T. 2002. How unfair is optimal routing? Proc. 13th Annual ACM-SIAM Sympos. on Discrete Algorithms (SODA). SIAM, Philadelphia, PA, 203-204.
65. Roughgarden, T. 2004. Stackelberg scheduling strategies. SIAM J. Comput. 33 332-350.
66. Roughgarden, T., É. Tardos. 2002. How bad is selfish routing? J. ACM 49 236-259.
67. Schulz, A. S., N. E. Stier-Moses. 2003. On the performance of user equilibria in traffic networks. Proc. 14th Annual ACM-SIAM Sympos. on Discrete, Algorithms (SODA). SIAM, Philadelphia, PA, 86-87.
68. Schulz, A. S., N. E. Stier-Moses. 2004. Efficiency and fairness of system-optimal routing with user constraints. Networks. Forthcoming.
69. Sheffi, Y. 1985. Urban Transportation Networks. Prentice-Hall, Englewood Cliffs, NJ.
70. Texas Transportation Institute. 2002. Urban mobility study. Available at http://mobility.tamu.edu/ums.
71. Wardrop, J. G. 1952. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers, Part II, Vol. 1, 325-378.
72. Yang, H., S. Yagar. 1994. Traffic assignment and traffic control in general freeway-arterial corridor systems. Transportation Res. 28B 463-486.
73. Yang, T. A., S. Shekhar, B. Hamidzadeh, P. A. Hancock. 1991. Path planning and evaluation in IVHS databases. Proc. IEEE Vehicle. Navigation and Information Systems Conf., Vol. 1. Society of Automotive Engineers, Warrendale, PA, 283-290.