A column generation approach to railway crew recovery problem in disruption

Jun Imaizumi, Rei Miura, Eiki Shigeta, Susumu Morito

    Research output: Contribution to journalArticle

    Abstract

    Crew Recovery Problem frequently appears in transport industries. This problem is to modify schedules of crews who cannot perform their tasks in their duties given beforehand as the result from Crew Scheduling Problem because of delays of trains or flights. To obtain a good modified schedule of crews is needed when delay occurs while it is more important to find alternative and acceptable schedule(s) quickly. In this paper, we formulate the problem in railways as an integer programming problem and propose an approach to this as a basic framework for similar problems arising in transport industries. Our heuristic approach is based on the idea of column generation method, which is one of the effective and powerful methods for large scale integer programming problems. The procedure generates various schedules for a certain instance by gradually increasing the number of crews to be rescheduled, giving the lower bound to the optimal value of the objective function in each iteration. Numerical experiments are performed to instances from Japanese railway. The results indicate that our approach successfully gives good schedules in short computation time.

    Original languageEnglish
    Pages (from-to)418-424
    Number of pages7
    JournalIEEJ Transactions on Electronics, Information and Systems
    Volume134
    Issue number3
    DOIs
    Publication statusPublished - 2014

    Fingerprint

    Integer programming
    Recovery
    Industry
    Scheduling
    Experiments

    Keywords

    • Column generation method
    • Crew scheduling
    • Heuristic
    • Integer programming
    • Railway
    • Recovery

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    A column generation approach to railway crew recovery problem in disruption. / Imaizumi, Jun; Miura, Rei; Shigeta, Eiki; Morito, Susumu.

    In: IEEJ Transactions on Electronics, Information and Systems, Vol. 134, No. 3, 2014, p. 418-424.

    Research output: Contribution to journalArticle

    Imaizumi, Jun ; Miura, Rei ; Shigeta, Eiki ; Morito, Susumu. / A column generation approach to railway crew recovery problem in disruption. In: IEEJ Transactions on Electronics, Information and Systems. 2014 ; Vol. 134, No. 3. pp. 418-424.
    @article{bce6149c54224c83bf4a34fb67cd189a,
    title = "A column generation approach to railway crew recovery problem in disruption",
    abstract = "Crew Recovery Problem frequently appears in transport industries. This problem is to modify schedules of crews who cannot perform their tasks in their duties given beforehand as the result from Crew Scheduling Problem because of delays of trains or flights. To obtain a good modified schedule of crews is needed when delay occurs while it is more important to find alternative and acceptable schedule(s) quickly. In this paper, we formulate the problem in railways as an integer programming problem and propose an approach to this as a basic framework for similar problems arising in transport industries. Our heuristic approach is based on the idea of column generation method, which is one of the effective and powerful methods for large scale integer programming problems. The procedure generates various schedules for a certain instance by gradually increasing the number of crews to be rescheduled, giving the lower bound to the optimal value of the objective function in each iteration. Numerical experiments are performed to instances from Japanese railway. The results indicate that our approach successfully gives good schedules in short computation time.",
    keywords = "Column generation method, Crew scheduling, Heuristic, Integer programming, Railway, Recovery",
    author = "Jun Imaizumi and Rei Miura and Eiki Shigeta and Susumu Morito",
    year = "2014",
    doi = "10.1541/ieejeiss.134.418",
    language = "English",
    volume = "134",
    pages = "418--424",
    journal = "IEEJ Transactions on Electronics, Information and Systems",
    issn = "0385-4221",
    publisher = "The Institute of Electrical Engineers of Japan",
    number = "3",

    }

    TY - JOUR

    T1 - A column generation approach to railway crew recovery problem in disruption

    AU - Imaizumi, Jun

    AU - Miura, Rei

    AU - Shigeta, Eiki

    AU - Morito, Susumu

    PY - 2014

    Y1 - 2014

    N2 - Crew Recovery Problem frequently appears in transport industries. This problem is to modify schedules of crews who cannot perform their tasks in their duties given beforehand as the result from Crew Scheduling Problem because of delays of trains or flights. To obtain a good modified schedule of crews is needed when delay occurs while it is more important to find alternative and acceptable schedule(s) quickly. In this paper, we formulate the problem in railways as an integer programming problem and propose an approach to this as a basic framework for similar problems arising in transport industries. Our heuristic approach is based on the idea of column generation method, which is one of the effective and powerful methods for large scale integer programming problems. The procedure generates various schedules for a certain instance by gradually increasing the number of crews to be rescheduled, giving the lower bound to the optimal value of the objective function in each iteration. Numerical experiments are performed to instances from Japanese railway. The results indicate that our approach successfully gives good schedules in short computation time.

    AB - Crew Recovery Problem frequently appears in transport industries. This problem is to modify schedules of crews who cannot perform their tasks in their duties given beforehand as the result from Crew Scheduling Problem because of delays of trains or flights. To obtain a good modified schedule of crews is needed when delay occurs while it is more important to find alternative and acceptable schedule(s) quickly. In this paper, we formulate the problem in railways as an integer programming problem and propose an approach to this as a basic framework for similar problems arising in transport industries. Our heuristic approach is based on the idea of column generation method, which is one of the effective and powerful methods for large scale integer programming problems. The procedure generates various schedules for a certain instance by gradually increasing the number of crews to be rescheduled, giving the lower bound to the optimal value of the objective function in each iteration. Numerical experiments are performed to instances from Japanese railway. The results indicate that our approach successfully gives good schedules in short computation time.

    KW - Column generation method

    KW - Crew scheduling

    KW - Heuristic

    KW - Integer programming

    KW - Railway

    KW - Recovery

    UR - http://www.scopus.com/inward/record.url?scp=84897704500&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84897704500&partnerID=8YFLogxK

    U2 - 10.1541/ieejeiss.134.418

    DO - 10.1541/ieejeiss.134.418

    M3 - Article

    AN - SCOPUS:84897704500

    VL - 134

    SP - 418

    EP - 424

    JO - IEEJ Transactions on Electronics, Information and Systems

    JF - IEEJ Transactions on Electronics, Information and Systems

    SN - 0385-4221

    IS - 3

    ER -