Toll pricing and heterogeneous users: Approximation algorithms for finding bicriterion time-dependent efficient paths in large-scale traffic networks

Transportation Research Record

Volumn , Issue 1923, 2005, Pages 28-36

  Mahmassani, Hani S ^a   Zhou, Xuesong ^a   Lu, Chung Cheng ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COST EFFECTIVENESS; OPTIMIZATION; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC;

APPROXIMATION ALGORITHMS; TIME AND COST CRITERIA; TRAFFIC ASSIGNMENT; TRAFFIC NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 33645665199     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1923-04     Document Type: Conference Paper

References (22)

1. Small, K. A., and J. Yan. The Value of "Value Pricing" of Roads: Second-Best Pricing and Product Differentiation. Journal of Urban Economics, Vol. 49, 2001, pp. 310-336.
2. Lam, T. C., and K. A. Small. The Value of Time and Reliability: Measurement from a Value Pricing Experiment. Transportation Research Part E: Logistics and Transportation Review, Vol. 37, 2001, pp. 231-251.
3. Dial, R. B. Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms. Transportation Science, Vol. 30, No. 2, 1996, pp. 93-110.
4. Leurent, F. The Theory and Practice of a Dual Criteria Assignment Model with Continuously Distributed Values-of-Times. In Transportation and Traffic Theory (J. B. Lesort, ed.), Pergamon, Exeter, United Kingdom, 1996, pp. 455-477.
5. Elimam, A., and D. Kohler. Two Engineering Applications of a Constrained Shortest-Path Model. European Journal of Operation Research, Vol. 103, 1997, pp. 426-428.
6. Dial, R. B. A Model and Algorithms for Multicriteria Route-Mode Choice. Transportation Research Part B: Methodological, Vol. 13, 1979, pp. 311-316.
7. Leurent, F. Cost Versus Time Equilibrium over a Network. European Journal of Operation Research, Vol. 71, 1993, pp. 205-221.
8. Henig, M.I. The Shortest Path Problem with Two Objectives. European Journal of Operation Research, Vol. 25, 1985, pp. 281-291.
9. Mote, J., I. Murthy, and D. Olson. A Parametric Approach to Solving Bicriterion Shortest Path Problems. European Journal of Operation Research, Vol. 53, 1991, pp. 81-92.
10. Dial, R. B. Bicriterion Traffic Assignment: Efficient Algorithms Plus Examples. Transportation Research Part B: Methodological, Vol. 31, 1997, pp. 357-379.
11. Hansen, P. Bicriterion Path Problems. In Multiple Criteria Decision Making: Theory and Applications (G. Fandel and T. Gal, eds.), Springer, Heidelberg, Germany, 1980, pp. 109-127.
12. Miller-Hooks, E., and H. S. Mahmassani. Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 143-151.
13. Garey, M., and D. Johnson. Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman, San Francisco, 1979.
14. Climaco, J. C. N., and E. Q. V. Martin. A Bicriterion Shortest Path Algorithm. European Journal of Operation Research, Vol. 11, 1982, pp. 399-404.
15. Warburton, A. Approximation of Pareto Optima in Multiple-Objective Shortest Path Problems. Operations Research, Vol. 35, 1987, pp. 70-79.
16. Hassin, R. Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operation Research, Vol. 17, 1992, pp. 36-42.
17. Nielsen, L. R. Route Choice in Stochastic Time-Dependent Networks: Theory, Algorithms, and Computational Experience. Ph.D. thesis. Department of Operations Research, University of Aarhus, Denmark, 2003.
18. Jayakrishnan, R., H. S. Mahmassani, and T.-Y. Hu. An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Network. Transportation Research C, Vol. 2, 1994, pp. 129-147.
19. Marcotte, P. Reformulations of a Bi-criterion Equilibrium Model. In Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (M. Fukushima and L. Qi, eds.), Kluwer Academic, Dordrecht, Netherlands, 1999, pp. 269-292.
20. Ziliaskopoulos, A. K., and H. S. Mahmassani. Time-Dependent Shortest-Path Algorithm for Real-Time Intelligent Vehicle Highway System Applications. In Transportation Research Record 1408, TRB, National Research Council, Washington, D.C., 1993, pp. 94-100.
21. Ross, S. A First Course in Probability. Prentice-Hall, Inc., New York, 2002.
22. Mahmassani, H. S. Dynamic Network Traffic Assignment and Simulation Methodology for Advanced System Management Applications. Networks and Spatial Economics, Vol. 12, 2001, pp. 267-292.