Network-optimized road pricing: Part II: algorithms and examples

Operations Research

Volumn 47, Issue 2, 1999, Pages 327-336

  Dial, Robert B ^a  

^a VOLPE NATIONAL TRANSPORTATION SYSTEMS CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HIGHWAY TRAFFIC CONTROL; MATHEMATICAL MODELS; OPTIMIZATION; RANDOM PROCESSES; TOLL HIGHWAYS;

MULTIPATH TRAFFIC ASSIGNMENT; ROAD NETWORK;

TRANSPORTATION ROUTES;

EID: 0032636621     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.2.327     Document Type: Article

References (21)

1. Ahuja, R., T. Magnanti, J. Orlin. 1993. Network Flows. Prentice Hall, New York.
2. Bergendorft, P., D. Hearn, M. Ramana. 1996. Congestion toll pricing in traffic networks, Research Report 96-1. Department of Industrial and Systems Engineering, University of Florida, Gainsville.
3. Cottle, R., J.-S. Pang, R. Stone. 1992. The Linear Complementarity Problem. Academic Press, New York.
4. Dial, R. 1996a. Bicriterion traffic assignment: basic theory and elementary algorithms. Transp. Sci. 30(2) 93-111.
5. _. 1996b. Bicriterion traffic assignment: efficient algorithms plus examples. Transp. Res. B31(1) 357-359.
6. _. 1999. Network-optimized road pricing: part I: a parable and a model. Oper. Res. 47(1) 54-64.
7. Friesz, T., R. Tobin, H. Cho, N. Metha. 1990. Sensitivity analysis-based heuristic algorithms for mathematical programs with variational inequality constraints. Math. Programming 48(1) 265-284.
8. Harker, P., J.-S. Pang. 1990. Finite dimensional variational inequality and nonlinear complementary problems: a survey of theory, algorithms and applications. Math. Programming 48 49-68.
9. Hearn, D., S. Lawphongpanich. 1984. Simplicial decomposition of the asymmetric traffic assignment problem. Transp. Res. 18B(2) 123-133.
10. _, _, J. Ventura. 1987. Restricted simplicial decomposition: computation and extensions. Math. Programming Study 31 99-118.
11. Janson, B. 1991. Dynamic traffic assignment for urban road networks. Transp. Res. 25B 143-161.
12. Lemke, C. E. 1978. Some pivot schemes for the linear complementarity problem. Math. Programming Study 7 15-35.
13. Magnanti, T., G. Perakis. 1993a. On the convergence of classical variational inequality algorithms. Working Paper OR 282-93, Operations Research Center, MIT, Cambridge, MA.
14. _, _. 1993b. A unifying geometric solution framework and complexity analysis for variational inequalities. Working Paper OR 276-93, Operations Research Center, MIT, Cambridge, MA.
15. _, _. 1994a. From Frank-Wolfe to steepest descent: a descent framework for solving VIPs. Presentation at TIMS/ORSA Joint National Meeting, Boston, MA.
16. _, _. 1994b. From Frank-Wolfe to steepest descent: a descent framework for solving VIPs. Presentation at TIMS/ORSA Joint National Meeting, Boston, MA.
17. Orlin, J. 1993. 2-criteria and 3-criteria shortest path problem: a proposal. Personal Correspondence, MIT, Cambridge, MA.
18. Rockafellar, R. T. 1984. Network Flows and Monotropic Optimization. John Wiley & Sons, New York.
19. Smith, M. J. 1983. An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function. Transp. Res. 17B 365-371.
20. Von Hohenbalken, B. 1977. Simplicial decomposition in nonlinear programming problems. Math. Programming 13 49-68.
21. Wardrop, J. 1952. Some theoretical aspects of road traffic research. Proc. Inst. of Civil Engineers, Part 2 325-378.