The morning commute under flat toll and tactical waiting

被引:57
|
作者
Xiao, Feng [1 ]
Shen, Wei [2 ]
Zhang, H. Michael [3 ]
机构
[1] SW Jiaotong Univ, Sch Transportat & Logist, Chengdu, Peoples R China
[2] Walmart ECommerce, San Bruno, CA 94066 USA
[3] Univ Calif Davis, Dept Civil & Environm Engn, Davis, CA 95616 USA
关键词
Bottleneck; Flat toll; Morning commute; Tactical waiting; SINGLE-BOTTLENECK; MODEL; CONGESTION; EQUILIBRIUM; PARKING; UNIQUENESS; DECISIONS; ECONOMICS; EXISTENCE; DEMAND;
D O I
10.1016/j.trb.2012.05.005
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper studies the morning commute problem under "tactical waiting", a phenomenon observable under situations when sudden drops in travel costs are present. Under such situations, travelers may find it advantageous to delay reaching the bottleneck by slowing down or waiting beside, even when there is still capacity left to serve them without delay. In this paper, we show that a flat toll during the morning commute potentially incurs tactical waiting under the assumptions of First-In-First-Out (FIFO) queue discipline and identical commuters; and derive all the possible equilibrium traffic patterns resulting from different choices of toll level and tolling period. Under the optimal toll pattern which minimizes the total system cost, we prove that there is no queue at the bottleneck at the starting or ending point of the tolling period and bottleneck capacity is fully utilized except during the period of tactical waiting. The optimal flat toll can reduce up to half of the queuing delay, but is in general not pareto-improving. However, if the revenue collected by the optimal flat toll is redistributed to the road users in the form of capacity expansion, the trip cost of each commuter will be reduced in the long-run. We also show that when building a new highway, the revenue from the optimal flat toll can never cover the capital cost of constructing the optimal capacity. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1346 / 1359
页数:14
相关论文
共 50 条
  • [1] The Morning Commute Problem with Coarse Toll and Nonidentical Commuters
    Xiao, Feng
    Qian, Zhen
    Zhang, H. Michael
    NETWORKS & SPATIAL ECONOMICS, 2011, 11 (02) : 343 - 369
  • [2] Stochastic bottleneck capacity, merging traffic and morning commute
    Xiao, Ling-Ling
    Liu, Ronghui
    Huang, Hai-Jun
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 64 : 48 - 70
  • [3] Managing morning commute traffic with parking
    Qian, Zhen
    Xiao, Feng
    Zhang, H. M.
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2012, 46 (07) : 894 - 916
  • [4] Manage morning commute problem of household travels under single-step toll: A comparison study
    Zhang, Yuan
    Zhao, Hui
    Jiang, Rui
    Shang, Ying
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2025, 174
  • [5] The morning commute in urban areas with heterogeneous trip lengths
    Lamotte, Raphael
    Geroliminis, Nikolas
    PAPERS SELECTED FOR THE 22ND INTERNATIONAL SYMPOSIUM ON TRANSPORTATION AND TRAFFIC THEORY, 2017, 23 : 591 - 611
  • [6] Congestion and environmental toll schemes for the morning commute with heterogeneous users and parallel routes
    Long, Jiancheng
    Szeto, W. Y.
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 129 : 305 - 333
  • [7] Departure Time and Route Choices With Accurate Information Under Binary Stochastic Bottleneck Capacity in the Morning Commute
    Yu, Yun
    Han, Xiao
    Jiang, Rui
    Darr, Justin
    Jia, Bin
    IEEE ACCESS, 2020, 8 : 225551 - 225565
  • [8] Tradable permit schemes for managing morning commute with carpool under parking space constraint
    Xiao, Ling-Ling
    Liu, Tian-Liang
    Huang, Hai-Jun
    TRANSPORTATION, 2021, 48 (04) : 1563 - 1586
  • [9] Expirable parking reservations for managing morning commute with parking space constraints
    Liu, Wei
    Yang, Hai
    Yin, Yafeng
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2014, 44 : 185 - 201
  • [10] Numerical solution procedures for the morning commute problem
    Nie, Yu
    Zhang, Michael H.
    MATHEMATICAL AND COMPUTER MODELLING, 2009, 49 (7-8) : 1295 - 1310