Strategies for road network design over time: Robustness under uncertainty

被引:53
|
作者
Szeto, W. Y. [1 ]
Lo, Hong K.
机构
[1] Univ Dublin Trinity Coll, Dept Civil Struct & Environm Engn, Dublin 2, Ireland
[2] Hong Kong Univ Sci & Technol, Dept Civil Engn, Hong Kong, Hong Kong, Peoples R China
来源
TRANSPORTMETRICA | 2005年 / 1卷 / 01期
关键词
time-dependent transport network design; network improvements financing; build-operate-transfer transport projects;
D O I
10.1080/18128600508685642
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Planning road network improvements over a long horizon often faces uncertainty. Under resource constraints, the government needs to carefully select a design strategy so as to cope with uncertainty and achieve its objective(s). Through sensitivity analyses, this paper discusses the social and financial aspects of three government's network design strategies, namely govemment-as-the-provider (GP), monopoly market (MM), and competitive market (CM). The first is the government acts as the sole toll road operator who provides the infrastructure but collects just enough tolls to recover costs. The second is the private sector builds all the toll roads based on the build-operate-transfer scheme and collects tolls in a monopoly manner. The third is the government allows multiple operators to build different toll roads but collect tolls under the build-operate-transfer scheme in a competitive manner. The results show that even though the GP strategy would produce the best total discounted consumer surplus (TDCS), maintaining cost recovery might be a problem. On the other hand, the MM strategy would mostly likely be profitable to the operators, at the expense of producing a much lower TDCS. It appears that the CM strategy would maintain a good balance between TDCS and profitability under uncertainty. This finding is consistent with the current trend of privatizing government services to multiple companies.
引用
收藏
页码:47 / 63
页数:17
相关论文
共 50 条
  • [31] Resilience-based network design under uncertainty
    Zhang, Xiaoge
    Mahadevan, Sankaran
    Sankararaman, Shankar
    Goebel, Kai
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2018, 169 : 364 - 379
  • [32] Robust Service Network Design Under Demand Uncertainty
    Wang, Zujian
    Qi, Mingyao
    TRANSPORTATION SCIENCE, 2020, 54 (03) : 676 - 689
  • [33] Network Design Model with Evacuation Constraints Under Uncertainty
    Nahum, Oren E.
    Hadas, Yuval
    Rossi, Riccardo
    Gastaldi, Massimiliano
    Gecchele, Gregorio
    19TH EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT2016), 2017, 22 : 489 - 498
  • [34] Optimal design of logistics network for remanufacturing under uncertainty
    Mao H.
    Rui W.
    Li X.
    Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition), 2010, 40 (02): : 425 - 430
  • [35] Flexible supply chain network design under uncertainty
    Chatzikontidou, Anastasia
    Longinidis, Pantelis
    Tsiakis, Panagiotis
    Georgiadis, Michael C.
    CHEMICAL ENGINEERING RESEARCH & DESIGN, 2017, 128 : 290 - 305
  • [36] Robust Reverse Logistics Network Design under Uncertainty
    Sun, Qiang
    2ND INTERNATIONAL CONFERENCE ON COMPLEX SCIENCE MANAGEMENT AND EDUCATION SCIENCE (CSMES 2015), 2015, : 242 - 246
  • [37] Robust optimization for petrochemical network design under uncertainty
    Al-Qahtani, K.
    Elkamel, A.
    Ponnambalam, K.
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2008, 47 (11) : 3912 - 3919
  • [38] Ferry service network design under demand uncertainty
    Lo, Hong K.
    An, Kun
    Lin, Wei-hua
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2013, 59 : 48 - 70
  • [39] Humanitarian logistics network design under mixed uncertainty
    Tofighi, S.
    Torabi, S. A.
    Mansouri, S. A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (01) : 239 - 250
  • [40] Robust transportation network design under demand uncertainty
    Ukkusuri, Satish V.
    Mathew, Tom V.
    Waller, S. Travis
    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2007, 22 (01) : 6 - 18