当前位置: X-MOL 学术Transp. Res. Part B Methodol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Modeling and managing the morning commute problem with park-and-ride-sharing
Transportation Research Part B: Methodological ( IF 6.8 ) Pub Date : 2021-06-25 , DOI: 10.1016/j.trb.2021.06.004
Zhihui Huang , Jiancheng Long , W.Y. Szeto , Haoxiang Liu

In this paper, park-and-ride-sharing (P&RS) is proposed to manage morning peak hour congestion in a monocentric linear city, where there is a multilane highway with a single bottleneck connecting the residential area and the central business district (CBD). To realize ride-sharing matching, a ride-sharing parking lot (RSPL) and a ride-sharing meeting point (RSMP) are set up somewhere between the origin and the bottleneck. To encourage ride-sharing participation, the lanes of the highway are physically divided into high occupancy vehicle (HOV) and general purpose (GP) lanes for only ride-sharing vehicles and non-ride-sharing vehicles, respectively. The user equilibrium principle in terms of generalized travel cost is adopted to formulate commuters’ mode choice and arrival time choice at the RSMP. It is demonstrated that there exist three possible equilibrium ride-sharing matching patterns and three possible equilibrium traffic flow patterns. All possible equilibrium ride-sharing matching and traffic flow patterns are analytically derived. In addition, to minimize total system cost (TSC), three break-even parking charge schemes are designed under the case that all parking lots are managed by the government. The optimal allocation scheme of bottleneck capacity to HOV lanes under each parking charge scheme is analytically derived. Finally, numerical examples are provided to illustrate the properties of the proposed bottleneck model with P&RS and the effectiveness of the designed parking charge schemes.



中文翻译:

使用停车和乘车共享建模和管理早上的通勤问题

在本文中,停车和乘车共享 (P&RS) 被提议用于管理单中心线性城市的早高峰时段拥堵,其中有一条多车道高速公路,连接住宅区和中央商务区 (CBD) . 为了实现拼车匹配,在起点和瓶颈之间设置拼车停车场(RSPL)和拼车汇合点(RSMP)。为了鼓励拼车参与,高速公路的车道在物理上分为高占用车辆(HOV)和通用(GP)车道,分别供拼车车辆和非拼车车辆使用。采用广义出行成本的用户均衡原理,制定了RSMP通勤者的出行方式选择和到达时间选择。证明存在三种可能的均衡乘车匹配模式和三种可能的均衡交通流模式。所有可能的均衡乘车共享匹配和交通流模式都是通过分析推导出来的。此外,为了最大限度地降低系统总成本(TSC),在所有停车场均由政府管理的情况下,设计了三种收支平衡的停车收费方案。分析推导出各停车收费方案下HOV车道瓶颈容量的最优分配方案。最后,提供了数值例子来说明所提出的带有 P&RS 的瓶颈模型的特性以及设计的停车收费方案的有效性。所有可能的均衡乘车共享匹配和交通流模式都是通过分析推导出来的。此外,为了最大限度地降低系统总成本(TSC),在所有停车场均由政府管理的情况下,设计了三种收支平衡的停车收费方案。分析推导出各停车收费方案下HOV车道瓶颈容量的最优分配方案。最后,提供了数值例子来说明所提出的带有 P&RS 的瓶颈模型的特性以及设计的停车收费方案的有效性。所有可能的均衡乘车共享匹配和交通流模式都是通过分析推导出来的。此外,为了最大限度地降低系统总成本(TSC),在所有停车场均由政府管理的情况下,设计了三种收支平衡的停车收费方案。分析推导出各停车收费方案下HOV车道瓶颈容量的最优分配方案。最后,提供了数值例子来说明所提出的带有 P&RS 的瓶颈模型的特性以及设计的停车收费方案的有效性。分析推导出各停车收费方案下HOV车道瓶颈容量的最优分配方案。最后,提供了数值例子来说明所提出的带有 P&RS 的瓶颈模型的特性以及设计的停车收费方案的有效性。分析推导出各停车收费方案下HOV车道瓶颈容量的最优分配方案。最后,提供了数值例子来说明所提出的带有 P&RS 的瓶颈模型的特性以及设计的停车收费方案的有效性。

更新日期:2021-06-25
down
wechat
bug