IDEAS home Printed from https://ideas.repec.org/a/taf/tjrtxx/v13y2025i4p682-707.html
   My bibliography  Save this article

An optimal scheduling method for heavy haul trains with virtual coupling technology

Author

Listed:
  • Lezhou Wu
  • Hao Ye
  • Wei Dong
  • Ming Jiang
  • Xiaoquan Yu
  • Zongqi Xu

Abstract

Heavy haul transportation enjoys the benefits of cost-efficiency by using long trains, but suffers from high cost in combination process and low efficiency in bottleneck areas. Virtual coupling technology (VCT) is helpful in resolving the dilemma. In this paper, we propose an optimal method for scheduling the route, timetable, and combination scheme of heavy haul trains with VCT in an integrated way. Specifically, six groups of constraints are first established, in which the sequence and train length problems incorporated by virtual coupling are properly handled. Then, a combined objective function comprised makespan and total flowtime indicators is proposed to optimize the throughput and turnover rate and further speeds up the optimization convergence. Finally, the optimization problem equipped with the proposed constraints and the combined objective function is transformed into an integer linear programming problem and solved by GUROBI. Simulation results demonstrate the effectiveness and advantages of the proposed method in leveraging VCT, and the benefits of virtual coupling over traditional physical coupling for heavy haul transportation.

Suggested Citation

  • Lezhou Wu & Hao Ye & Wei Dong & Ming Jiang & Xiaoquan Yu & Zongqi Xu, 2025. "An optimal scheduling method for heavy haul trains with virtual coupling technology," International Journal of Rail Transportation, Taylor & Francis Journals, vol. 13(4), pages 682-707, July.
  • Handle: RePEc:taf:tjrtxx:v:13:y:2025:i:4:p:682-707
    DOI: 10.1080/23248378.2024.2400173
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/23248378.2024.2400173?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

    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:tjrtxx:v:13:y:2025:i:4:p:682-707. 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/tjrt20 .

    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.