On the morning commute problem with bottleneck congestion and parking space constraints

• Investigated the morning commute problem with both bottleneck congestion and parking space constraints.
• Examined the situation when some commuters have reserved parking spots while others have to compete for public ones.
• Appropriate combination of reserved and unreserved parking spots can temporally relieve bottleneck congestion.
• System performance is quantified in terms of the relative proportions of the two classes of commuters.

Morning commuters choose their departure times based on a combination of factors—the chances of running into bottleneck congestion, the likely schedule delays, and parking space availability. This study investigates the morning commute problem with both bottleneck congestion and parking space constraints. In particular, it considers the situation when some commuters have reserved parking spots while others have to compete for public ones on a first-come-first-served basis. Unlike the traditional pure bottleneck model, the rush-hour dynamic traffic pattern with a binding parking capacity constraint varies with the relative proportions of the two classes of commuters. It is found that an appropriate combination of reserved and unreserved parking spots can temporally relieve traffic congestion at the bottleneck and hence reduce the total system cost, because commuters without a reserved parking spot are compelled to leave home earlier in order to secure a public parking spot. System performance is quantified in terms of the relative proportions of the two classes of commuters and is compared with those in the extreme cases when all auto commuters have to compete for parking and when none of them have to compete for one.