IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v47y2011i6p1221-1243.html
   My bibliography  Save this article

Tactical crew planning in railways

Author

Listed:
  • Şahin, Güvenç
  • Yüceoğlu, Birol

Abstract

Tactical crew capacity planning problem in railways involves finding the minimum number of crews in a region required to operate a predetermined set of train duties satisfying the strict day-off requirement for crew. For the single-region problem, we develop two solution approaches based on a space–time network representation: the sequential approach and the integrated approach. We also study the multi-regional capacity planning problem where we minimize total system-wide capacity by simultaneously considering multiple regions within a neighborhood search algorithm based on our solution methods for the single-region problem. We present the computational study on problem instances from Turkish State Railways.

Suggested Citation

  • Şahin, Güvenç & Yüceoğlu, Birol, 2011. "Tactical crew planning in railways," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1221-1243.
    • Handle: RePEc:eee:transe:v:47:y:2011:i:6:p:1221-1243
    DOI: 10.1016/j.tre.2011.05.013
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    2. Guo, Yufeng & Mellouli, Taieb & Suhl, Leena & Thiel, Markus P., 2006. "A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1169-1181, June.
    3. Abbink, E.J.W. & Albino, L. & Dollevoet, T.A.B. & Huisman, D. & Roussado, J. & Saldanha, R.L., 2010. "Solving Large Scale Crew Scheduling Problems in Practice," Econometric Institute Research Papers EI 2010-63, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Kroon, L.G. & Fischetti, M., 2000. "Crew Scheduling for Netherlands Railways: "destination: customer"," ERIM Report Series Research in Management ERS-2000-56-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    5. Freling, R. & Lentink, R.M. & Odijk, M.A., 2000. "Scheduling train crews: a case study for the Dutch Railways," Econometric Institute Research Papers EI 2000-17/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kirsten Hoffmann & Udo Buscher & Janis Sebastian Neufeld & Felix Tamke, 2017. "Solving Practical Railway Crew Scheduling Problems with Attendance Rates," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 59(3), pages 147-159, June.
    2. Brian Roth & Anantaram Balakrishnan & Pooja Dewan & April Kuo & Dasaradh Mallampati & Juan Morales, 2018. "Crew Decision Assist: System for Optimizing Crew Assignments at BNSF Railway," Interfaces, INFORMS, vol. 48(5), pages 436-448, October.
    3. Neufeld, Janis S. & Scheffler, Martin & Tamke, Felix & Hoffmann, Kirsten & Buscher, Udo, 2021. "An efficient column generation approach for practical railway crew scheduling with attendance rates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1113-1130.
    4. Suyabatmaz, Ali Çetin & Şahin, Güvenç, 2015. "Railway crew capacity planning problem with connectivity of schedules," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 84(C), pages 88-100.
    5. Jorge Amaya & Paula Uribe, 2018. "A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 383-402, October.
    6. Feng, Tao & Lusby, Richard M. & Zhang, Yongxiang & Tao, Siyu & Zhang, Bojian & Peng, Qiyuan, 2024. "A branch-and-price algorithm for integrating urban rail crew scheduling and rostering problems," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    7. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Y. Wang (Ying) & Z. Shang (Zheming) & Huisman, D. & D'Ariano, A. & J.C. Zhang (Jinchuan), 2018. "A Lagrangian Relaxation Approach Based on a Time-Space-State Network for Railway Crew Scheduling," Econometric Institute Research Papers EI2018-45, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Doi, Tsubasa & Nishi, Tatsushi & Voß, Stefan, 2018. "Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time," European Journal of Operational Research, Elsevier, vol. 267(2), pages 428-438.
    3. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    4. F. Zeynep Sargut & Caner Altuntaş & Dilek Cetin Tulazoğlu, 2017. "Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1071-1096, October.
    5. Jütte, Silke & Thonemann, Ulrich W., 2012. "Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems," European Journal of Operational Research, Elsevier, vol. 219(2), pages 214-223.
    6. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    7. David Rea & Craig Froehle & Suzanne Masterson & Brian Stettler & Gregory Fermann & Arthur Pancioli, 2021. "Unequal but Fair: Incorporating Distributive Justice in Operational Allocation Models," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2304-2320, July.
    8. Ellen Bockstal & Broos Maenhout, 2019. "A study on the impact of prioritising emergency department arrivals on the patient waiting time," Health Care Management Science, Springer, vol. 22(4), pages 589-614, December.
    9. X Zhang & A Chakravarthy & Q Gu, 2009. "Equipment scheduling problem under disruptions in mail processing and distribution centres," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(5), pages 598-610, May.
    10. Saravanan Kesavan & Susan J. Lambert & Joan C. Williams & Pradeep K. Pendem, 2022. "Doing Well by Doing Good: Improving Retail Store Performance with Responsible Scheduling Practices at the Gap, Inc," Management Science, INFORMS, vol. 68(11), pages 7818-7836, November.
    11. Patrik Eveborn & Mikael Rönnqvist & Helga Einarsdóttir & Mats Eklund & Karin Lidén & Marie Almroth, 2009. "Operations Research Improves Quality and Efficiency in Home Care," Interfaces, INFORMS, vol. 39(1), pages 18-34, February.
    12. Mauro Falasca & Christopher Zobel & Cliff Ragsdale, 2011. "Helping a Small Development Organization Manage Volunteers More Efficiently," Interfaces, INFORMS, vol. 41(3), pages 254-262, June.
    13. Mate Barany & Zsolt Tuza, 2015. "Circular coloring of graphs via linear programming and tabu search," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 833-848, December.
    14. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.
    15. Elina Rönnberg & Torbjörn Larsson, 2010. "Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study," Health Care Management Science, Springer, vol. 13(1), pages 35-53, March.
    16. Young-Chae Hong & Amy Cohn & Stephen Gorga & Edmond O’Brien & William Pozehl & Jennifer Zank, 2019. "Using Optimization Techniques and Multidisciplinary Collaboration to Solve a Challenging Real-World Residency Scheduling Problem," Interfaces, INFORMS, vol. 49(3), pages 201-212, May.
    17. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    18. Lotfi Hidri & Achraf Gazdar & Mohammed M. Mabkhot, 2020. "Optimized Procedure to Schedule Physicians in an Intensive Care Unit: A Case Study," Mathematics, MDPI, vol. 8(11), pages 1-24, November.
    19. Broos Maenhout & Mario Vanhoucke, 2008. "Comparison and hybridization of crossover operators for the nurse scheduling problem," Annals of Operations Research, Springer, vol. 159(1), pages 333-353, March.
    20. Balázs Kecskeméti & Adrián Bilics, 2013. "Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(4), pages 745-755, December.

    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:transe:v:47:y:2011:i:6:p:1221-1243. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.