IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/102346.html
   My bibliography  Save this article

Optimizing Schedules of Rail Train Circulations by Tabu Search Algorithm

Author

Listed:
  • Mingming Chen
  • Huimin Niu

Abstract

This paper develops an integer programming model for the scheduling problem in train circulations on an intercity rail line. The model that aims to minimize the sum of interval time for any two consecutive tasks is proposed to characterize the train operation process. Two main constraints, namely, time-shift and equilibrium constraint, are considered to get the feasible and practical solution of train schedules. A heuristic procedure using tabu search algorithm is also designed to solve the model by introducing the penalty function and a neighborhood search method with the trip exchange and insert strategy. A computational experiment performed on test instances provided by two major stations on the Beijing–Tianjin Intercity Railway in China illustrates the proposed model and algorithm.

Suggested Citation

  • Mingming Chen & Huimin Niu, 2013. "Optimizing Schedules of Rail Train Circulations by Tabu Search Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-7, December.
    • Handle: RePEc:hin:jnlmpe:102346
    DOI: 10.1155/2013/102346
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2013/102346.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2013/102346.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/102346?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
    ---><---

    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:hin:jnlmpe:102346. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.