[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i9p2028-2042.html
   My bibliography  Save this article

A constraint programming based column generation approach for crew scheduling: A case study for the Kayseri railway

Author

Listed:
  • Pınar Tapkan
  • Sinem Kulluk
  • Lale Özbakır
  • Fatih Bahar
  • Burak Gülmez
Abstract
Although railway systems have been widely used in public transportation for several years, crew scheduling research focuses on airline operations. Since the crew costs constitute the critical part of the operational costs in railway public transportation, the crew scheduling problem gains more importance. Crew scheduling aims to assign all trips to duty packages in a timeline while satisfying several labour working rules, company requirements, and operational restrictions. Because of the complexity of real-world conditions, crew scheduling problems are NP-complete. In this study, the crew scheduling problem was addressed, and a constraint programming based column generation algorithm was proposed as a solution approach. A column generation algorithm was employed to solve problems having a considerable number of variables. In this study, the master problem was designed as a set partitioning problem that aimed to assign all trips to duty while minimizing the cost. In the subproblem, new column(s) satisfying all constraints were generated and added to the master problem to reduce the cost. To analyse the performance of the proposed approach, an integer programming model of the problem was developed. An extensive computational study is presented to compare the results of these two modelling approaches via different real-life problem instances.

Suggested Citation

  • Pınar Tapkan & Sinem Kulluk & Lale Özbakır & Fatih Bahar & Burak Gülmez, 2023. "A constraint programming based column generation approach for crew scheduling: A case study for the Kayseri railway," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(9), pages 2028-2042, September.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:9:p:2028-2042
    DOI: 10.1080/01605682.2022.2125843
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2125843
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2022.2125843?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:tjorxx:v:74:y:2023:i:9:p:2028-2042. 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.