IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i5p1532-1555.html
   My bibliography  Save this article

Uncertain demand based integrated optimisation for train timetabling and coupling on the high-speed rail network

Author

Listed:
  • Ziyan Feng
  • Chengxuan Cao
  • Alireza Mostafizi
  • Haizhong Wang
  • Ximing Chang

Abstract

Transportation is an important component in the logistics and production processes. To accurately match rapidly growing demand and limited transport capacity, the goal of minimising costs while ensuring high service quality under existing infrastructure has received significant attention. This paper presents an integrated optimisation approach for the short-term operational management under daily fluctuating demand, with a focus on two key strategic decisions: train timetabling and coupling. In particular, an integrated two-stage stochastic model and a combined heuristic local search algorithm with the branch-and-bound method are developed to (1) obtain the optimal demand assignment to the rail network, (2) investigate trains’ coupling plans to avoid waste of resources when demand is low, and (3) add candidate trains to generate new feasible timetables when demand surges. To verify the solving method, a lower bound algorithm is introduced. Using a hypothetical small-scale and a real-world China high-speed rail network as numerical experiments, different demand scales and critical parameters are tested to obtain optimised timetables. The results show that good solutions are achieved in several seconds, making it possible to adjust trains’ schedules efficiently and effectively according to the variable demand in short-term operational management.

Suggested Citation

  • Ziyan Feng & Chengxuan Cao & Alireza Mostafizi & Haizhong Wang & Ximing Chang, 2023. "Uncertain demand based integrated optimisation for train timetabling and coupling on the high-speed rail network," International Journal of Production Research, Taylor & Francis Journals, vol. 61(5), pages 1532-1555, March.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:5:p:1532-1555
    DOI: 10.1080/00207543.2022.2042415
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2042415
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2042415?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:tprsxx:v:61:y:2023:i:5:p:1532-1555. 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/TPRS20 .

    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.