zbMATH — the first resource for mathematics

A hybrid route choice model for dynamic traffic assignment. (English) Zbl 1332.90068
Summary: Network user equilibrium or user optimum is an ideal state that can hardly be achieved in real traffic. More often than not, every day traffic tends to be in disequilibrium rather than equilibrium, thanks to uncertainties in demand and supply of the network. In this paper we propose a hybrid route choice model for studying non-equilibrium traffic. It combines pre-trip route choice and en-route route choice to solve dynamic traffic assignment (DTA) in large-scale networks. Travelers are divided into two groups, habitual travelers and adaptive travelers. Habitual travelers strictly follow their pretrip routes which can be generated in the way that major links, such as freeways or major arterial streets, are favored over minor links, while taking into account historical traffic information. Adaptive travelers are responsive to real-time information and willing to explore new routes from time to time. We apply the hybrid route choice model in a synthetic mediumscale network and a large-scale real network to assess its effect on the flow patterns and network performances, and compare them with those obtained from Predictive User Equilibrium (PUE) DTA. The results show that PUEDTA usually produces considerably less congestion and less frequent queue spillback than the hybrid route choice model. The ratio between habitual and adaptive travelers is crucial in determining realistic flow and queuing patterns. Consistent with previous studies, we found that, in non-PUE DTA, supplying a medium sized group (usually less than 50%) of travelers real-time information is more beneficial to network performance than supplying the majority of travelers with real-time information. Finally, some suggestions are given on how to calibrate the hybrid route choice model in practice to produce realistic results.

90B20 Traffic problems in operations research
90B10 Deterministic network models in operations research
Full Text: DOI
[1] Bell, MGH; Shield, CM; Busch, F; Kruse, G, A stochastic user equilibrium path flow estimator, Part C Emerg Technol, 5, 197-210, (1997)
[2] Bovy P, Stern E (1990) Wayfinding in transport networks. Kluwer Academic Publishers
[3] Bovy, PH; Fiorenzo-Catalano, S, Stochastic route choice set generation: behavioral and probabilistic foundations, Transportmetrica, 3, 173-189, (2007)
[4] Carey, M; Ge, YE, Comparison of methods for path flow reassignment for dynamic user equilibrium, Netw Spat Econ, (2011) · Zbl 1332.90065
[5] Cascetta E, Nuzzolo A, Russo F, Vitetta A (1996) A modified logit route choice model overcoming path overlapping problems: specification and some calibration results for interurban networks. In: Proceedings from the thirteenth international symposium on transportation and traffic theory · Zbl 0771.90039
[6] Daganzo, C, Queue spillovers in transportation networks with a route choice, Transp Sci, 32, 3-11, (1998) · Zbl 0987.90508
[7] Daganzo, CF, The cell transmission model: a dynamic representation of highway traffic consistent with the hydrodynamic theory, Transp Res, Part B, 28, 269-287, (1994)
[8] Daganzo, CF, The cell transmission model, part II: network traffic, Transp Res, Part B, 29, 79-93, (1995)
[9] Dia, H; Harney, D; Boyle, A, Dynamics of drivers’ route choice decisions under advanced traveler information systems, Roads and Transp Res, 10, 2-12, (2001)
[10] Friesz, TL; Bernstein, D; Smith, TE; Tobin, RL; Wei, BW, A variational inequality formulation of the dynamic network equilibrium problem, Oper Res, 41, 179-191, (1993) · Zbl 0771.90037
[11] Gao, S; Frejinger, E; Ben-Akiva, M, Cognitive cost in route choice with real-time information: an exploratory analysis, Transp Res, Part A Policy Pract, 45, 916-926, (2011)
[12] Ghali, M, A note on the minimum instantaneous cost path of the dynamic traffic assignment problem, Ann Oper Res, 60, 115-120, (1995) · Zbl 0842.90033
[13] Hawas, YE, Development and calibration of route choice utility models: neuro-fuzzy approach, J Transp Eng, 130, 171-182, (2004)
[14] Jin, W; Zhang, HM, On the distribution schemes for determining flows through a merge, Transp Res, Part B, 37, 521-540, (2003)
[15] Jin, W; Zhang, HM, Multicommodity kinematic wave simulation model for network traffic flow, Transp Res Rec, 1883, 59-67, (2004)
[16] Kant P (2008) Route choice modelling in dynamic traffic assignment. Master thesis, University of Twente. http://essay.utwente.nl/58303/
[17] Kuwahara, M; Akamatsu, T, Dynamic user optimal assignment with physical queues for many-to-many od pattern, Transp Res, Part B, 35, 461-479, (2001)
[18] Lebacque J (1996) The godunov scheme and what it means for first order traffic flow models. In: Procedings of international symposium of transport and traffic theory, pp 79-102
[19] Lee, C; Ran, B; Yang, F; Loh, WY, A hybrid tree approach to modeling alternate route choice behavior with online information, J of Intell Transp Sys: Technology, Planning, and Operations, 14, 209-219, (2010)
[20] Lighthill, MJ; Whitham, GB, On kinematic waves. ii. a theory of traffic flow on long crowded roads, Proc Royal Soc, 229, 317-345, (1955) · Zbl 0064.20906
[21] Mahmassani, HS; Jayakrishnan, R, System performance and user response under real-time information in a congested traffic corridor, Transp Res, Part A, 25, 293-307, (1991)
[22] Mahmassani, HS; Liu, YH, Dynamics of commuting decision behaviour under advanced traveller information systems, Transp Res, Part C, 7, 91-107, (1999)
[23] Merchant, D; Nemhauser, G, A model and an algorithm for the dynamic traffic assignment problem, Transp Sci, 12, 183-199, (1978)
[24] Nie, X; Zhang, HM, A comparative study of some macroscopic link models used in dynamic traffic assignment, Netw Spat Econ, 5, 89-115, (2005) · Zbl 1081.90017
[25] Nie Y (2006) A variational inequality approach for inferring dynamic origin-destination travel demands. PhD thesis, University of California at Davis · Zbl 1081.90017
[26] Nie, Y; Zhang, HM, Solving the dynamic user optimal assignment problem considering queue spillback, Netw Spat Econ, 10, 49-71, (2010) · Zbl 1183.90101
[27] Nie, YM; Wu, X; Mello, TH, Optimal path problems with second-order stochastic dominance constraints, Netw Spat Econ, (2011) · Zbl 1332.90184
[28] Peeta, S; Mahmassani, HS, Multiple user classes real-time traffic assignment for online operations: a rolling horizon solution framework, Transp Res, Part C Emerg Technol, 3, 83-98, (1995)
[29] Peeta, S; Yu, JW, A hybrid model for driver route choice incorporating en-route attributes and real-time information effects, Netw Spat Econ, 5, 21-40, (2005) · Zbl 1081.90018
[30] Pel, AJ; Bliemer, MC; Hoogendoorn, SP, Hybrid routing choice modeling in dynamic traffic assignment, Transp Res Rec, 2091, 100-107, (2009)
[31] Ramming S (2002) Network knowledge and route choice. PhD thesis, Massachusetts Institute of Technology · Zbl 1081.90018
[32] Ran, B; Boyce, DE; Leblanc, LJ, A new class of instantaneous dynamic user-optimal traffic assignment models, Oper Res, 41, 192-202, (1993) · Zbl 0771.90039
[33] Reddy, PDVG; Yang, H; Vaughn, KM; Abdel-Aty, MA; Kitamura, R; Jovanis, PP, Design of an artificial simulator for analyzing route choice behavior in the presence of information system, Math Comput Model, 22, 119-147, (1995) · Zbl 0838.90040
[34] Richards, PI, Shock waves on the highway, Proc R Soc, 4, 42-51, (1956)
[35] Smith, M, A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks, Transp Res, Part B, 26, 36-49, (1993)
[36] Ukkusuri, S; Patil, G, Exploring user behavior in online network equilibrium problems, Transp Res Rec: Journal of the Transportation Research Board, 2029, 31-38, (2007)
[37] Vovsha, P; Bekhor, S, The link-nested logit model of route choice: overcoming the route overlapping problem, Transp Res Rec, 1645, 133-142, (1998)
[38] Xu, H; Zhou, J; Xu, W, A decision-making rule for modeling travelers route choice behavior based on cumulative prospect theory, Transp Res, Part C Emerg Technol, 19, 218-228, (2011)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.