An improved incremental assignment model for parking variable message sign location problem |
| |
| Authors: | Xun‐You Ni Daniel Sun Zhong‐Ren Peng |
| |
| Affiliation: | 1. State Key Laboratory of Ocean Engineering, School of Naval Architecture, Ocean & Civil Engineering, Shanghai Jiao Tong University, Shanghai, China;2. Transportation Research Center, School of Naval Architecture, Ocean & Civil Engineering, Shanghai Jiao Tong University, Shanghai, China;3. Department of Urban and Regional Planning, University of Florida, Gainesville, FL, U.S.A |
| |
| Abstract: | Operators and planners of parking guidance and information system (PGIS) often encounter the difficulty when and how to provide parking information to drivers in peak hours. The aim of this study was to assign the parking demands onto the urban network, find the positions suitable to locate the parking variable message sign (parking VMS), and try to solve the problem when to provide parking information to drivers. Parking VMS, as the most common forms of the information display terminal of PGIS, becomes critical in designing PGIS. This paper started from analyzing the relationship between the location and the performances of parking VMS. If a parking VMS is placed right along the link approaching to the divarication intersection of the subsequent “shortest path” and the previous one, the travel time declines abruptly, and the guiding compliance ratio becomes superior. Then, the network‐based parking choice model for the parking VMS was proposed. Network modification and incremental assignment were used to find the divarication intersections caused by the changes of space availability. In addition, MATLAB software package (MathWorks, Inc., Natick, MA, USA) was adopted to calculate the entire process mentioned. The proposed model and the algorithm were applied to a numerical example, where the location of parking VMS was obtained. Copyright © 2015 John Wiley & Sons, Ltd. |
| |
| Keywords: | parking guidance and information system parking VMS divarication intersection network modification incremental assignment |
|
|
