A Model for Dynamic Parking Choice of Drivers

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.

[1]  Satish V. Ukkusuri,et al.  Dynamic User Equilibrium Model for Combined Activity-Travel Choices Using Activity-Travel Supernetwork Representation , 2010 .

[2]  Hani S. Mahmassani,et al.  Network performance under system optimal and user equilibrium dynamic assignments: Implications for , 1993 .

[3]  Ziyou Gao,et al.  A Cumulative Perceived Value-Based Dynamic User Equilibrium Model Considering the Travelers’ Risk Evaluation on Arrival Time , 2012 .

[4]  蒋亚琪 A dynamic traffic assignment model for a continuum transportation system , 2011 .

[5]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[6]  Bin Ran,et al.  A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models , 1993, Oper. Res..

[7]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[8]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[9]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[10]  Michael Florian,et al.  Application of a simulation-based dynamic traffic assignment model , 2008, Eur. J. Oper. Res..

[11]  Hai-Jun Huang,et al.  Dynamic user optimal traffic assignment model for many to one travel demand , 1995 .

[12]  W. Y. Szeto,et al.  A cell-based variational inequality formulation of the dynamic user optimal assignment problem , 2002 .

[13]  Huey-Kuo Chen Dynamic User-Optimal Route Choice Model , 1999 .

[14]  Robert L. Smith,et al.  User-equilibrium properties of fixed points in dynamic traffic assignment 1 1 This research was supp , 1998 .

[15]  Huey-Kuo Chen,et al.  Dynamic Travel Choice Models , 1999 .

[16]  H. M. Zhang,et al.  Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback , 2010 .

[17]  Michael Florian,et al.  Application of a simulation-based dynamic traffic assignment model , 2002 .

[18]  Bin Ran,et al.  MODELING DYNAMIC TRANSPORTATION NETWORKS , 1996 .