Toll Pricing and Heterogeneous Users

This paper presents both exact and approximation algorithms for finding extreme efficient time-dependent shortest paths for use with dynamic traffic assignment applications to networks with variable toll pricing and heterogeneous users (with different value of time preferences). A parametric least-generalized cost path algorithm is presented to determine a complete set of extreme efficient time-dependent paths that simultaneously consider travel time and cost criteria. However, exact procedures may not be practical for large networks. For this reason, approximation schemes are devised and tested. Based on the concept of ϵ-efficiency in multiobjective shortest path problems, a binary search framework is developed to find a set of extreme efficient paths that minimize expected approximation error, with the use of the underlying value of time distribution. Both exact and approximation schemes (along with variants) are tested on three actual traffic networks. The experimental results indicate that the computa...

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  R. Dial.  A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE , 1979 .

[3]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[4]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[5]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[6]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[7]  I. Murthy,et al.  A parametric approach to solving bicriterion shortest path problems , 1991 .

[8]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[9]  Hani S. Mahmassani,et al.  Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

[10]  F. Leurent.  Cost versus time equilibrium over a network , 1993 .

[11]  Hani S. Mahmassani,et al.  An evaluation tool for advanced traffic information and management systems in urban networks , 1994 .

[12]  Robert B. Dial,et al.  Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms , 1996, Transp. Sci..

[13]  A. A. Elimam,et al.  Two engineering applications of a constrained shortest-path model , 1997 .

[14]  Robert B. Dial,et al.  Bicriterion traffic assignment : Efficient algorithms plus examples , 1997 .

[15]  Patrice Marcotte.  Reformulations of a Bicriterion Equilibrium Model , 1998 .

[16]  Hani S. Mahmassani,et al.  Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks , 1998 .

[17]  Hani S. Mahmassani,et al.  Dynamic Network Traffic Assignment and Simulation Methodology for Advanced System Management Applications , 2001 .

[18]  K. Small,et al.  The Value of "Value Pricing" of Roads: Second-Best Pricing and Product Differentiation , 2001 .

[19]  B. Stockton.  THE VALUE OF VALUE PRICING , 2003 .

[20]  C Terence,et al.  The Value of Time and Reliability: Measurement from a Value Pricing Experiment , 2003 .

[21]  Lars Relund Nielsen,et al.  Route Choice in Stochastic Time-Dependent Networks , 2004 .