Morning Commute Problem in a Two-to-one Network with Parking Constraint

Liu, W. and Yang, H. (2012) Morning Commute Problem in a Two-to-one Network with Parking Constraint. In: 17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012, Kowloon, Hong Kong, 15-17 Dec 2012, pp. 247-254. ISBN 9789881581419

[img] Text
121387.pdf - Accepted Version
Restricted to Repository staff only

289kB

Abstract

Morning commuters often choose their departure times not only to trade off bottleneck congestion and schedule delays, but also in order to secure a parking spot due to limited parking spaces. It is the combination of these two forces that governs the commuters' departure time choices. This paper investigates the morning commute problem in a two-to-one network with both bottleneck congestion and parking space constraints; particularly when some commuters have reserved parking spots or parking permits and other commuters have to compete for public parking spots on a first-come first-served basis. Distinguished from the traditional pure bottleneck model, the rush-hour dynamic traffic pattern with binding parking capacity constraints varies with the relative portions of the two classes of commuters: those with and those without a reserved parking spot. It has been found that when the parking capacity is greater than half of the potential parking demand, it is socially preferred to retain some parking spots unreserved in a two-to-one network.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Liu, Dr Wei
Authors: Liu, W., and Yang, H.
College/School:College of Science and Engineering > School of Engineering > Infrastructure and Environment
ISBN:9789881581419
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record