Nothing Special   »   [go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v44y2021i5p524-542.html
   My bibliography  Save this article

A virtual resource-based method for formulating the safety headway of opposing trains arriving at the same station on a single-track railway line

Author

Listed:
  • Weining Hao
  • Haiying Li
  • Lingyun Meng
  • Jianrui Miao
Abstract
In train rescheduling, the arrival and departure times of trains at stations are normally constrained by many operations rules that must be respected. Therefore, different methods were proposed to describe train operations for preventing train conflicts, especially concerning the safety headways. This paper develops a virtual resource-based method in place of the commonly used big-M method and ‘either-or’ constraints for reformulating the safety headway of opposing trains arriving at the same station on a single-track rail. This new formulation can provide an efficient decomposition mechanism by decomposing the original complex problem into several single train-based subproblems. A resource-oriented mixed-integer linear programming model based on a time-space network is developed to minimize the total train delay time with cumulative flow variables used to describe time-space resources occupation. We also present a set of numerical experiments based on a single-track railway line in China to evaluate the validity of the proposed method.

Suggested Citation

  • Weining Hao & Haiying Li & Lingyun Meng & Jianrui Miao, 2021. "A virtual resource-based method for formulating the safety headway of opposing trains arriving at the same station on a single-track railway line," Transportation Planning and Technology, Taylor & Francis Journals, vol. 44(5), pages 524-542, July.
    • Handle: RePEc:taf:transp:v:44:y:2021:i:5:p:524-542
    DOI: 10.1080/03081060.2021.1927305
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060.2021.1927305
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03081060.2021.1927305?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:transp:v:44:y:2021:i:5:p:524-542. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

    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.