Abstract
Taking time-varying parking demands and supplies into account, this paper develops a dynamic parking choice model to simulate drivers’ searching for parking spaces between parking lots. In this study, each parking lot has one access passage and vehicles can move or wait for entering the park in the access passage. The flow propagation formula in the access passage of parking lots is established to obtain the number of vehicles entering the parking lot from the access passage within each time interval. This paper brings forward the instantaneous dynamic user-optimal condition of dynamic parking choice, constructs an equivalent variational inequality (VI) model and develops a diagonalization algorithm to solve the model. A numerical example demonstrates the rate of in-flow, the rate of out-flow, link flow, instantaneous travel time on each link or access passage of the parking lot, and the amount and routes of cruising traffic at each time point.References
Mahamassani HS, Peeta S. Network performance under system optimal and user equilibrium dynamic assignment: implications for ATIS. Transportation Research Record. 1993 Aug;1408:83-93.
Florian M, Mahut M, Tremblay N. Application of a simulation-based dynamic traffic assignment model. European Journal of Operational Research. 2008 Sep;189(3):1381-1392.
Merchant DK, Nemhauser GL. A model and an algorithm for the dynamic traffic assignment. Transportation Science. 1978 Aug;12(3):183-199.
Carey M. Optimal time-varying flows on congestion networks. Operations Research. 1987 Feb;35(1):58-69.
Ran R, LeBlanc LJ, Boyce DE. Dynamic user-optimal route choice models based on stochastic route travel times. Second Int. Capri Seminar on Urban Traffic Networks; 1992.
Lam WHK and Huang HJ. Dynamic user optimal traffic assignment model for many to one travel demand. Transportation Research B. 1995 Aug;29(4):243-259.
Ran B, Boyce DE, LeBlanc LJ. A new class of instantaneous dynamic user-optimal traffic assignment models. Operations Research. 1993 Feb;41(1):192-202.
Ran B, Boyce DE. Modeling dynamic transportation network: an intelligent transportation system oriented approach. Springer-Verlag Berlin and Heidelberg GmbH & Co. K; 1996.
Chen HK. Dynamic travel choice model: A variational inequality approach. Springer-Verlag Berlin and Heidelberg GmbH & Co. K; 1999.
Nie Y, Zhang HM. Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback. Networks & Spatial Economics. 2010 March;10(1):49-71.
Kaufman DE, Smith RL, Wunderlich KE. User-equilibrium properties of fixed points in dynamic traffic assignment. Transportation Research C. 1998 Feb;6(1-2):1-16.
Lo HK, Szeto WY. A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transportation Research B. 2002 June;36(5):421-443.
Ramadurai G, Ukkusuri S. Dynamic user equilibrium model for combined activity-travel choices using activity-travel supernetwork representation. Networks & Spatial Economics. 2010 June;10(2):273-292.
Tian LJ, Huang HJ, Gao ZY. A cumulative perceived value-based dynamic user equilibrium model considering the travelers’ risk evaluation on arrival time. Networks & Spatial Economics. 2012 Dec;12(4):589-608.
Jiang Y, Wong SC, Ho HW, Zhang P, Liu R, Agachai S. A dynamic traffic assignment model for a continuum transportation system. Transportation Research B. 2011 Feb;45(2):343-363.
Gao ZY, Ren HL. Urban dynamic traffic assignment model and algorithm [in Chinese]. Beijing: Renmin Jiaotong Press; 2005.
Frank M, Wolfe P. An algorithm for quadratic programming. Naval Research Logistics Quarterly. 1956 June;3(2):95 -110.
Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, N J; 1985.
