IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v43y2021i2d10.1007_s00291-021-00622-3.html
   My bibliography  Save this article

A network flow-based algorithm for bus driver rerostering

Author

Listed:
  • Ana Paias

    (Universidade de Lisboa, C6
    Universidade de Lisboa, C6)

  • Marta Mesquita

    (Universidade de Lisboa, C6
    Instituto Superior de Agronomia, Universidade de Lisboa)

  • Margarida Moz

    (Universidade de Lisboa, C6
    Universidade de Lisboa)

  • Margarida Pato

    (Universidade de Lisboa, C6
    Universidade de Lisboa)

Abstract

Bus driver rostering generates the work plan for a pool of drivers during a planning period of predefined length. This plan, called the roster, must consider the balance between the pressure of costs, the provision of a service of high quality, labour agreements, and the goodwill of the workers. The bus driver rerostering problem occurs during real-time operational planning, when unexpected events—such as non-planned absences of drivers—disrupt the roster. To reconstruct a roster which is originally built in a context of days off schedules for drivers, we propose a reactive methodology based on a multicommodity flow assignment mixed integer linear programming model. The objective is to minimise the number of depot drivers who are assigned to drive and the number of postponed days off, as well as the dissimilarity between the reconstructed and the original roster and the balancing of the workload. The proposed algorithm enables the disrupted roster to be reconstructed at the expense of a relatively small number of changes in drivers’ work and rest periods, while, at the same time, controlling the dimension of the multicommodity flow network. Computational experience based on real-life based instances revealed that the algorithm has the ability to produce reconstructed rosters with few changes to the drivers’ original work assignment, in a short CPU time.

Suggested Citation

  • Ana Paias & Marta Mesquita & Margarida Moz & Margarida Pato, 2021. "A network flow-based algorithm for bus driver rerostering," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 543-576, June.
    • Handle: RePEc:spr:orspec:v:43:y:2021:i:2:d:10.1007_s00291-021-00622-3
    DOI: 10.1007/s00291-021-00622-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-021-00622-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-021-00622-3?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. Chunhua Gao & Ellis Johnson & Barry Smith, 2009. "Integrated Airline Fleet and Crew Robust Planning," Transportation Science, INFORMS, vol. 43(1), pages 2-16, February.
    2. Mesquita, Marta & Moz, Margarida & Paias, Ana & Pato, Margarida, 2015. "A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern," European Journal of Operational Research, Elsevier, vol. 245(2), pages 423-437.
    3. Margarida Moz & Margarida Pato, 2003. "An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules," Annals of Operations Research, Springer, vol. 119(1), pages 285-301, March.
    4. Lin Xie & Marius Merschformann & Natalia Kliewer & Leena Suhl, 2017. "Metaheuristics approach for solving personalized crew rostering problem in public bus transit," Journal of Heuristics, Springer, vol. 23(5), pages 321-347, October.
    5. Daniel Potthoff & Dennis Huisman & Guy Desaulniers, 2010. "Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling," Transportation Science, INFORMS, vol. 44(4), pages 493-505, November.
    6. 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.
    7. Jonas Ingels & Broos Maenhout, 2017. "Employee substitutability as a tool to improve the robustness in personnel scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 623-658, July.
    8. Maenhout, Broos & Vanhoucke, Mario, 2013. "Reconstructing nurse schedules: Computational insights in the problem size parameters," Omega, Elsevier, vol. 41(5), pages 903-918.
    9. Vandankumar M. Trivedi & D. Michael Warner, 1976. "A Branch and Bound Algorithm for Optimum Allocation of Float Nurses," Management Science, INFORMS, vol. 22(9), pages 972-981, May.
    Full references (including those not matched with items on IDEAS)

    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. Borgonjon, Tessa & Maenhout, Broos, 2022. "An exact approach for the personnel task rescheduling problem with task retiming," European Journal of Operational Research, Elsevier, vol. 296(2), pages 465-484.
    2. Maenhout, Broos & Vanhoucke, Mario, 2018. "A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 806-823.
    3. Jonas Ingels & Broos Maenhout, 2017. "Employee substitutability as a tool to improve the robustness in personnel scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 623-658, July.
    4. Ingels, Jonas & Maenhout, Broos, 2019. "Optimised buffer allocation to construct stable personnel shift rosters," Omega, Elsevier, vol. 82(C), pages 102-117.
    5. Wolbeck, Lena & Kliewer, Natalia & Marques, Inês, 2020. "Fair shift change penalization scheme for nurse rescheduling problems," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1121-1135.
    6. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    7. Toni I. Wickert & Pieter Smet & Greet Vanden Berghe, 2021. "Quantifying and enforcing robustness in staff rostering," Journal of Scheduling, Springer, vol. 24(3), pages 347-366, June.
    8. João P. Pita & Cynthia Barnhart & António P. Antunes, 2013. "Integrated Flight Scheduling and Fleet Assignment Under Airport Congestion," Transportation Science, INFORMS, vol. 47(4), pages 477-492, November.
    9. Oliver Faust & Jochen Gönsch & Robert Klein, 2017. "Demand-Oriented Integrated Scheduling for Point-to-Point Airlines," Transportation Science, INFORMS, vol. 51(1), pages 196-213, February.
    10. Liang, Zhe & Feng, Yuan & Zhang, Xiaoning & Wu, Tao & Chaovalitwongse, Wanpracha Art, 2015. "Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 238-259.
    11. 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.
    12. Valentina Cacchiani & Juan-José Salazar-González, 2017. "Optimal Solutions to a Real-World Integrated Airline Scheduling Problem," Transportation Science, INFORMS, vol. 51(1), pages 250-268, February.
    13. Jon D. Petersen & Gustaf Sölveling & John-Paul Clarke & Ellis L. Johnson & Sergey Shebalov, 2012. "An Optimization Approach to Airline Integrated Recovery," Transportation Science, INFORMS, vol. 46(4), pages 482-500, November.
    14. van Lieshout, R.N. & Mulder, J. & Huisman, D., 2016. "The Vehicle Rescheduling Problem with Retiming," Econometric Institute Research Papers EI2016-37, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Laura Calvet & Rocio de la Torre & Anita Goyal & Mage Marmol & Angel A. Juan, 2020. "Modern Optimization and Simulation Methods in Managerial and Business Economics: A Review," Administrative Sciences, MDPI, vol. 10(3), pages 1-23, July.
    16. Dollevoet, T.A.B. & Pecin, D. & Spliet, R., 2020. "The path programming problem and a partial path relaxation," Econometric Institute Research Papers EI-2020-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    18. Wright, P. Daniel & Mahar, Stephen, 2013. "Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction," Omega, Elsevier, vol. 41(6), pages 1042-1052.
    19. Thijs Verhaegh & Dennis Huisman & Pieter-Jan Fioole & Juan C. Vera, 2017. "A heuristic for real-time crew rescheduling during small disruptions," Public Transport, Springer, vol. 9(1), pages 325-342, July.
    20. Dekker, M.M. & van Lieshout, R.N. & Ball, R.C. & Bouman, P.C. & Dekker, S.C. & Dijkstra, H.A. & Goverde, R.M.P. & Huisman, D. & Panja, D. & Schaafsma, A.M. & van den Akker, M., 2018. "A Next Step in Disruption Management: Combining Operations Research and Complexity Science," Econometric Institute Research Papers EI2018-25, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:spr:orspec:v:43:y:2021:i:2:d:10.1007_s00291-021-00622-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.