IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v23y2017i5d10.1007_s10732-017-9348-7.html
   My bibliography  Save this article

Metaheuristics approach for solving personalized crew rostering problem in public bus transit

Author

Listed:
  • Lin Xie

    (Leuphana University of Lüneburg)

  • Marius Merschformann

    (University of Paderborn)

  • Natalia Kliewer

    (Freie Universität Berlin)

  • Leena Suhl

    (University of Paderborn)

Abstract

The crew rostering problem in public bus transit aims at constructing personalized monthly schedules for all drivers. This problem is often formulated as a multi-objective optimization problem, since it considers the interests of both the management of bus companies and the drivers. Therefore, this paper attempts to solve the multi-objective crew rostering problem with the weighted sum of all objectives using ant colony optimization, simulated annealing, and tabu search methods. To the best of our knowledge, this is the first paper that attempts to solve the personalized crew rostering problem in public transit using different metaheuristics, especially the ant colony optimization. The developed algorithms are tested on numerical real-world instances, and the results are compared with ones solved by commercial solvers.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:joheur:v:23:y:2017:i:5:d:10.1007_s10732-017-9348-7
    DOI: 10.1007/s10732-017-9348-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9348-7
    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/s10732-017-9348-7?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. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. Bianco, Lucio & Bielli, Maurizio & Mingozzi, Aristide & Ricciardelli, Salvatore & Spadoni, Massimo, 1992. "A heuristic procedure for the crew rostering problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 272-283, April.
    3. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    4. Carraresi, P. & Gallo, G., 1984. "A multi-level bottleneck assignment approach to the bus drivers' rostering problem," European Journal of Operational Research, Elsevier, vol. 16(2), pages 163-173, May.
    5. Fred Glover, 1990. "Tabu Search: A Tutorial," Interfaces, INFORMS, vol. 20(4), pages 74-94, August.
    6. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    7. Tallys H. Yunes & Arnaldo V. Moura & Cid C. de Souza, 2005. "Hybrid Column Generation Approaches for Urban Transit Crew Management Problems," Transportation Science, INFORMS, vol. 39(2), pages 273-288, May.
    8. Vítor Barbosa & Filipe Alvelos & Ana Respício, 2016. "Bus Driver Rostering by Column Generation Metaheuristics," Lecture Notes in Economics and Mathematical Systems, in: Raquel J. Fonseca & Gerhard-Wilhelm Weber & João Telhada (ed.), Computational Management Science, edition 1, pages 225-231, Springer.
    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. 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.
    2. Raka Jovanovic & Antonio P. Sanfilippo & Stefan Voß, 2022. "Fixed set search applied to the multi-objective minimum weighted vertex cover problem," Journal of Heuristics, Springer, vol. 28(4), pages 481-508, August.
    3. 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.
    4. Adibah Shuib & Faiq Izzuddin Kamarudin, 2019. "Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model," Annals of Operations Research, Springer, vol. 272(1), pages 355-372, January.

    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. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    2. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    3. Shao, Saijun & Xu, Gangyan & Li, Ming & Huang, George Q., 2019. "Synchronizing e-commerce city logistics with sliding time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 17-28.
    4. R Logendran & Y Karim, 2003. "Design of manufacturing cells in the presence of alternative cell locations and material transporters," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1059-1075, October.
    5. Hai Wang, 2019. "Routing and Scheduling for a Last-Mile Transportation System," Service Science, INFORMS, vol. 53(1), pages 131-147, February.
    6. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    7. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    8. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    9. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    10. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    11. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    12. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    13. 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.
    14. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    15. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    16. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    17. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    18. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    19. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    20. Daniel O’Malley & Velimir V Vesselinov & Boian S Alexandrov & Ludmil B Alexandrov, 2018. "Nonnegative/Binary matrix factorization with a D-Wave quantum annealer," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-12, 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:spr:joheur:v:23:y:2017:i:5:d:10.1007_s10732-017-9348-7. 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.