Increasing mobility in cities by controlling overcrowding
AbstractVarious theories have been proposed to describe vehicular traffic movement in cities on an aggregate level. They fall short to create a macroscopic model with variable inputs and outputs that could describe a rush hour dynamically. This dissertation work shows that a macroscopic fundamental diagram (MFD) relating production (the product of average flow and network length) and accumulation (the product of average density and network length) exists for neighborhoods of cities in the order of 5-10km2. It also demonstrates that conditional on accumulation large networks behave predictably and independently of their origin-destination tables. These results are based on analysis using simulation of large scale city networks and real data from urban metropolitan areas. The real experiment uses a combination of fixed detectors and floating vehicle probes as sensors. The analysis also reveals a fixed relation between the space-mean flows on the whole network and the trip completion rates, which dynamically measure accessibility. This work also demonstrates that the dynamics of the rush hour can be predicted quite accurately without the knowledge of disaggregated data. This MFD is applied to develop perimeter control strategies based on neighborhood accumulation and speeds and improve accessibility without the uncertainty inherent in todayâ€™s forecast-based approaches. The looking-for-parking phenomenon that extends the average trip length is also integrated in the dynamics of the rush hour.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Institute of Transportation Studies, UC Berkeley in its series Institute of Transportation Studies, Research Reports, Working Papers, Proceedings with number qt5wg9j6z7.
Date of creation: 01 Dec 2007
Date of revision:
Contact details of provider:
Postal: 109 McLaughlin Hall, Mail Code 1720, Berkeley, CA 94720-1720
Web page: http://www.escholarship.org/repec/its/
More information through EDIRC
Modeling and Network Analysis;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Glazer, Amihai & Niskanen, Esko, 1992.
"Parking fees and congestion,"
Regional Science and Urban Economics,
Elsevier, vol. 22(1), pages 123-132, March.
- Glazer, Amihai & Niskanen, Esko, 2001. "Parking fees and congestion," University of California Transportation Center, Working Papers qt9h51t02k, University of California Transportation Center.
- Arnott, Richard & Rowse, John, 1999.
Journal of Urban Economics,
Elsevier, vol. 45(1), pages 97-124, January.
- Edward Calthrop & Stef Proost & Kurt van Dender, 2000. "Parking Policies and Road Pricing," Urban Studies, Urban Studies Journal Limited, vol. 37(1), pages 63-76, January.
- Anderson, Simon P. & de Palma, Andre, 2004. "The economics of pricing parking," Journal of Urban Economics, Elsevier, vol. 55(1), pages 1-20, January.
- Daganzo, Carlos F., 2007. "Urban gridlock: Macroscopic modeling and mitigation approaches," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 49-62, January.
- Daganzo, Carlos F., 2002. "A behavioral theory of multi-lane traffic flow. Part I: Long homogeneous freeway sections," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 131-158, February.
- Nikolas Geroliminis & David Levinson, 2008. "Cordon pricing consistent with the physics of overcrowding," Working Papers 000038, University of Minnesota: Nexus Research Group.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lisa Schiff).
If references are entirely missing, you can add them using this form.