IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v55y2021i5p1206-1225.html
   My bibliography  Save this article

Optimizing Disruption Tolerance for Rail Transit Networks Under Uncertainty

Author

Listed:
  • Lei Xu

    (The Shenzhen Research Institute of Big Data, Shenzhen 518000, China)

  • Tsan Sheng (Adam) Ng

    (Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 119077)

  • Alberto Costa

    (Future Resilient Systems, Singapore-ETH Centre, Singapore 138602)

Abstract

In this paper, we develop a distributionally robust optimization model for the design of rail transit tactical planning strategies and disruption tolerance enhancement under downtime uncertainty. First, a novel performance function evaluating the rail transit disruption tolerance is proposed. Specifically, the performance function maximizes the worst-case expected downtime that can be tolerated by rail transit networks over a family of probability distributions of random disruption events given a threshold commuter outflow. This tolerance function is then applied to an optimization problem for the planning design of platform downtime protection and bus-bridging services given budget constraints. In particular, our implementation of platform downtime protection strategy relaxes standard assumptions of robust protection made in network fortification and interdiction literature. The resulting optimization problem can be regarded as a special variation of a two-stage distributionally robust optimization model. In order to achieve computational tractability, optimality conditions of the model are identified. This allows us to obtain a linear mixed-integer reformulation that can be solved efficiently by solvers like CPLEX. Finally, we show some insightful results based on the core part of Singapore Mass Rapid Transit Network.

Suggested Citation

  • Lei Xu & Tsan Sheng (Adam) Ng & Alberto Costa, 2021. "Optimizing Disruption Tolerance for Rail Transit Networks Under Uncertainty," Transportation Science, INFORMS, vol. 55(5), pages 1206-1225, September.
  • Handle: RePEc:inm:ortrsc:v:55:y:2021:i:5:p:1206-1225
    DOI: 10.1287/trsc.2021.1040
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1040
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2021.1040?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:55:y:2021:i:5:p:1206-1225. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.