IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i8p1318-1334.html
   My bibliography  Save this article

MILP formulations and a TS algorithm for reliable last train timetabling with uncertain transfer flows

Author

Listed:
  • Shuo Yang
  • Kai Yang
  • Lixing Yang
  • Ziyou Gao

Abstract

This paper aims to develop reliable last train timetabling models for increasing number of successful transfer passengers and reducing total running time for metro corporations. The model development is based on an observation that real-world transfer flows capture the characteristics of randomness in a subway network. For systematically modelling uncertainty, a sample-based representation and two types of non-expected evaluation criteria, namely max–min reliability criterion and percentile reliability criterion are proposed to generate reliable timetables for last trains. The equivalent mixed integer linear programming formulations are deduced for the respective evaluation strategies by introducing auxiliary variables. Based upon the linearised models, an efficient tabu search (TS) algorithm incorporating solution generation method is presented. Finally, a number of small problem instances are solved using CPLEX for the linear models. The obtained results are also used as a platform for assessing the performance of proposed TS approach which is then tested on large Beijing Subway instances with promising results.

Suggested Citation

  • Shuo Yang & Kai Yang & Lixing Yang & Ziyou Gao, 2018. "MILP formulations and a TS algorithm for reliable last train timetabling with uncertain transfer flows," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(8), pages 1318-1334, August.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:8:p:1318-1334
    DOI: 10.1080/01605682.2017.1392406
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ning, Jia & Xing, Xinjie & Wang, Yadong & Yao, Yu & Kang, Liujiang & Peng, Qiyuan, 2024. "Coordinating last-train timetabling with app-based ride-hailing service under uncertainty," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 636(C).
    2. Gkiotsalitis, K. & Cats, O. & Liu, T. & Bult, J.M., 2023. "An exact optimization method for coordinating the arrival times of urban rail lines at a common corridor," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).

    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:tjorxx:v:69:y:2018:i:8:p:1318-1334. 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/tjor .

    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.