Multiclass,Multicriteria Dynamic Traffic Assignment with Path-Dependent Link Cost and Entropy-Based Risk Preference

Abstract

Challenges arise in dynamic traffic assignment (DTA) when heterogeneous users evaluate choices on the basis of multiple interrelated criteria such as travel time and travel time uncertainty. This paper proposes a density-based formulation along with a stochastic quasigradient projection (SQGP) solution scheme with the aid of a traffic simulator. Path-dependent link cost is proposed to allow for the objective function formulation and more tractable analysis. The criteria in the discussion and the case study are travel time (link-additive), monetary cost (non additive), and travel time uncertainty (path-dependent link-additive). An information entropy-based uncertainty measure is proposed because of concerns about using conventional measures such as variability and reliability. The case study shows stochastic and efficient convergence, demonstrates the ability of SQGP to bypass local optima, and exemplifies the significant effect of using path-independent and path-dependent link costs to forecast traffic pattern and toll revenue. The results also suggest that a pricing strategy aimed at optimizing travel time and reliability for different user classes should consider travel time correlations between toll segments and the adjacent no-toll segments if enumerating paths is practically infeasible.

Get full access to this article

View all access options for this article.

References

Peeta

, and Ziliaskopoulos

A. K.

. Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future. Networks and Spatial Economics, Vol. 1, No. 3/4, 2001, pp. 233–265. https://doi.org/10.1023/A:1012827724856.

Jayakrishnan

, Tsai

W. K.

, and Chen

. A Dynamic Traffic Assignment Model with Traffic-Flow Relationships. Transportation Research Part C: Emerging Technologies, Vol. 3, No. 1, 1995, pp. 51–72. https://doi.org/10.1016/0968-090X(94)00015-W.

Yang

, and Jayakrishnan

. Gradient Projection Method for Simulation-Based Dynamic Traffic Assignment. Transportation Research Record: Journal of the Transportation Research Board, No. 2284, 2012, pp. 70–80. https://doi.org/10.3141/2284-09.

Jayakrishnan

, Tsai

W. T.

, Prashker

J. N.

, and Rajadhyaksha

. A Faster Path-Based Algorithm for Traffic Assignment. University of California Transportation Center, Berkeley, 1994.

Yang

, and Huang

H. J.

. The Multi-Class, Multi-Criteria Traffic Network Equilibrium and Systems Optimum Problem. Transportation Research Part B: Methodological, Vol. 38, No. 1, 2004, pp. 1–15. https://doi.org/10.1016/S0191-2615(02)00074-7.

Washington

S. P.

, Karlaftis

M. G.

, and Mannering

. Random-Parameter Models (Chapter 16). In Statistical and Econometric Methods for Transportation Data Analysis. CRC Press, Boca Raton, Fla., 2010.

Liu

H. X.

, Recker

, and Chen

. Uncovering the Contribution of Travel Time Reliability to Dynamic Route Choice Using Real-Time Loop Data. Transportation Research Part A: Policy and Practice, Vol. 38, No. 6, 2004, pp. 435–453. https://doi.org/10.1016/j.tra.2004.03.003.

de Palma

, and Picard

. Route Choice Decision Under Travel Time Uncertainty. Transportation Research Part A: Policy and Practice, Vol. 39, No. 4, 2005, pp. 295–324. https://doi.org/10.1016/j.tra.2004.10.001.

Ramos

G. M.

, Daamen

, and Hoogendoorn

. A State-of-the-Art Review: Developments in Utility Theory, Prospect Theory and Regret Theory to Investigate Travellers’ Behaviour in Situations Involving Travel Time Uncertainty. Transport Reviews, Vol. 34, No. 1, 2014, pp. 46–67. https://doi.org/10.1080/01441647.2013.856356.

10.

Climaco

J. C. N.

, and Martins

E. Q. V.

. A Bicriterion Shortest Path Algorithm. European Journal of Operational Research, Vol. 11, No. 4, 1982, pp. 399–404. https://doi.org/10.1016/0377-2217(82)90205-3.

11.

Mote

, Murthy

, and Olson

D. L.

. A Parametric Approach to Solving Bicriterion Shortest Path Problems. European Journal of Operational Research, Vol. 53, No. 1, 1991, pp. 81–92. https://doi.org/10.1016/0377-2217(91)90094-C.

12.

Martins

E. Q. V.

On a Multicriteria Shortest Path Problem.

European Journal of Operational Research, Vol. 16, No. 2, 1984, pp. 236–245. https://doi.org/10.1016/0377-2217(84)90077-8.

13.

Skriver

A. J.

, and Andersen

K. A.

. A Label Correcting Approach for Solving Bicriterion Shortest-Path Problems. Computers and Operations Research, Vol. 27, No. 6, 2000, pp. 507–524. https://doi.org/10.1016/S0305-0548(99)00037-4.

14.

Chen

B. Y.

, Lam

W. H.

, Sumalee

, and Shao

. An Efficient Solution Algorithm for Solving Multi-Class Reliability-Based Traffic Assignment Problem. Mathematical and Computer Modelling, Vol. 54, No. 5/6, 2011, pp. 1428–1439. https://doi.org/10.1016/j.mcm.2011.04.015.

15.

Tan

, Yang

, and Guo

. Pareto Efficiency of Reliability-Based Traffic Equilibria and Risk-Taking Behavior of Travelers. Transportation Research Part B: Methodological, Vol. 66, 2014, pp. 16–31. https://doi.org/10.1016/j.trb.2013.12.003.

16.

Bliemer

M. C.

, and Bovy

P. H.

. Quasi-Variational Inequality Formulation of the Multiclass Dynamic Traffic Assignment Problem. Transportation Research Part B: Methodological, Vol. 37, No. 6, 2003, pp. 501–519. https://doi.org/10.1016/S0191-2615(02)00025-5.

17.

Zhang

, Mahmassani

H. S.

, Lu

C.-C.

. Dynamic Pricing, Heterogeneous Users and Perception Error: Probit-Based Bi-Criterion Dynamic Stochastic User Equilibrium Assignment. Transportation Research Part C: Emerging Technologies, Vol. 27, pp. 189–204, 2013.

18.

Huang

H. J.

, and Li

Z. C.

. A Multiclass, Multicriteria Logit-Based Traffic Equilibrium Assignment Model Under ATIS. European Journal of Operational Research, Vol. 176, No. 3, 2007, pp. 1464–1477. https://doi.org/10.1016/j.ejor.2005.09.035.

19.

Jiang

, Mahmassani

H. S.

, and Zhang

. Congestion Pricing, Heterogeneous Users, and Travel Time Reliability: Multicriterion Dynamic User Equilibrium Model and Efficient Implementation for Large-Scale Networks. Transportation Research Record: Journal of the Transportation Research Board, No. 2254, 2011, pp. 58–67. https://doi.org/10.3141/2254-07.

20.

C.-C.

, Mahmassani

H. S.

, and Zhou

. Equivalent Gap Function-Based Reformulation and Solution Algorithm for the Dynamic User Equilibrium Problem. Transportation Research Part B: Methodological, Vol. 43, No. 3, 2009, pp. 345–364. https://doi.org/10.1016/j.trb.2008.07.005.

21.

Carey

Nonconvexity of the Dynamic Traffic Assignment Problem.

Transportation Research Part B: Methodological, Vol. 26, No. 2, 1992, pp. 127–133. https://doi.org/10.1016/0191-2615(92)90003-F.

22.

Shannon

C. E.

A Mathematical Theory of Communication, Part I, Part II.

Bell System Technical Journal, Vol. 27, 1948, pp. 623–659.

23.

Chen

, Lee

D. H.

, and Jayakrishnan

. Computational Study of State-of-the-Art Path-Based Traffic Assignment Algorithms. Mathematics and Computers in Simulation, Vol. 59, No. 6, 2002, pp. 509–518. https://doi.org/10.1016/S0378-4754(01)00437-2.