IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v313y2024i1p207-224.html
   My bibliography  Save this article

Train stop scheduling problem: An exact approach using valid inequalities and polar duality

Author

Listed:
  • Hamid, Faiz
  • Agarwal, Yogesh K.

Abstract

Consider the problem of minimizing the number of train stops on a particular rail line. The objective is to assign passengers of each origin-destination pair to different trains in such a way that train capacity and passenger demand constraints are satisfied with minimal stoppages. The literature refers to this problem as the train stop scheduling problem. The problem has been extensively studied for decades, yet an exact solution approach has not been proposed. This paper proposes several valid inequalities to strengthen the mixed-integer programming formulation and solve the problem exactly in a reasonable amount of CPU time. The concept of polar duality has been utilized to find more complex valid inequalities which may be hard to find otherwise. Despite the problem’s high practical relevance, valid inequalities for the problem have not yet been studied in the literature. An aggregation procedure has been proposed to solve large size problem instances exactly. Computational study demonstrate the efficacy of the proposed valid inequalities.

Suggested Citation

  • Hamid, Faiz & Agarwal, Yogesh K., 2024. "Train stop scheduling problem: An exact approach using valid inequalities and polar duality," European Journal of Operational Research, Elsevier, vol. 313(1), pages 207-224.
    • Handle: RePEc:eee:ejores:v:313:y:2024:i:1:p:207-224
    DOI: 10.1016/j.ejor.2023.07.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723005611
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.07.023?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.

    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:eee:ejores:v:313:y:2024:i:1:p:207-224. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.