Operators of parking guidance and information (PGI) systems often have difficulty in providing the best car park availability information to drivers in periods of high demand. A new PGI configuration model based on the optimized combination method was proposed by analyzing of parking choice behavior. This article first describes a parking choice behavioral model incorporating drivers perceptions of waiting times at car parks based on PGI signs. This model was used to predict the influence of PGI signs on the overall performance of the traffic system. Then relationships were developed for estimating the arrival rates at car parks based on driver characteristics, car park attributes as well as the car park availability information displayed on PGI signs. A mathematical program was formulated to determine the optimal display PGI sign configuration to minimize total travel time. A genetic algorithm was used to identify solutions that significantly reduced queue lengths and total travel time compared with existing practices. These procedures were applied to an existing PGI system operating in Deqing Town and Xiuning City. Significant reductions in total travel time of parking vehicles with PGI being configured. This would reduce traffic congestion and lead to various environmental benefits.
Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/610136 |
Date | January 2011 |
Creators | Mei, Zhenyu, Tian, Ye |
Contributors | Department of Civil Engineering, Zhejiang University, Hangzhou, 310058, China, Department of Civil Engineering and Engineering Mechanics, University of Arizona, Tucson, AZ 85721, USA |
Publisher | SpringerOpen |
Source Sets | University of Arizona |
Language | English |
Detected Language | English |
Type | Article |
Rights | © 2011 Mei and Tian; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0) |
Relation | http://jwcn.eurasipjournals.com/content/2011/1/104 |
Page generated in 0.0016 seconds