Advertisement

An Adaptive Large Neighborhood Search Heuristic to Solve the Crew Scheduling Problem

  • Leandro do Carmo Martins
  • Gustavo Peixoto SilvaEmail author
Chapter
Part of the Urban Computing book series (UC)

Abstract

This paper presents an adaptation of the adaptive large neighborhood search (ALNS) heuristic in order to solve the crew scheduling problem (CSP) of urban buses. The CSP consists in minimizing the total of crews that will drive a fleet in daily operation as well as the total overtime. The solution for the CSP is a set of duties performed by the crews throughout the day, and those duties must comply with labor laws, labor union agreements, and the company’s operational rules. The CSP is a NP-hard problem and it is usually solved by metaheuristics. Therefore, an ALNS-like heuristic was developed to solve the CSP. Its implementation was tested with real data from a bus company which operates in Belo Horizonte, MG-Brazil, and it provided solutions quite superior to those both adopted by the company and the ones generated by other methods in the literature.

Notes

Acknowledgements

The authors thank and appreciate CAPES (Coordination for the Improvement of Higher Level Personnel), CNPq (National Council for Scientific and Technological Development), FAPEMIG (Foundation for Research Support of Minas Gerais State), and UFOP (Federal University of Ouro Preto) for all the support received during this paper development.

References

  1. 1.
    Ahuja, R.K., Orlin, J.B., Sharma, D.: Very large-scale neighborhood search. Int. Trans. Oper. Res. 7, 301–317 (2000)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bodin, L., Golden, B., Assad, A., Ball, M.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10, 63–211 (1983)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Chen, S., Shen, Y.: An improved column generation algorithm for crew scheduling problems. Int. J. Inf. Comput. Sci. 10, 175–183 (2013).Google Scholar
  4. 4.
    Dunn, O.J.: Multiple comparisons using rank sums. Technometrics 6, 241–252 (1964)CrossRefGoogle Scholar
  5. 5.
    Fischetti, M., Martello, S., Toth, P.: The fixed job schedule problem with spread-time constraints. Oper. Res. 35, 849–858 (1987)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Kruskal, W.H., Wallis, W.A.: Use of ranks in one-criterion variance analysis. J. Am. Stat. Assoc. 47, 583–621 (1952)CrossRefGoogle Scholar
  7. 7.
    Lourenço, H.R., Paixão, J.P., Portugal, R.: Multiobjective metaheuristics for the bus driver scheduling problem. Transp. Sci. 35, 331–343 (2001)CrossRefGoogle Scholar
  8. 8.
    Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Potvin, J.-Y., Rousseau, J.-M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66, 331–340 (1993)CrossRefGoogle Scholar
  10. 10.
    Reis, A.S., Silva, G.: Um estudo de diferentes métodos de busca e a metaheurística VNS para otimizar a escala de motoristas de ônibus urbano. Transporte em Transformação XVI—Trabalhos Vencedores do Prêmio CNT de Produção Acadêmica 1, 45–64 (2012)Google Scholar
  11. 11.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)CrossRefGoogle Scholar
  12. 12.
    Ropke, S., Pisinger, D.: An unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171, 750–775 (2006)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Department of Computer Science, University of Strathclyde, Glasgow, Scotland. Citeseer (1997)Google Scholar
  14. 14.
    Smith, B.M., Wren, A.: A bus crew scheduling system using a set covering formulation. Transp. Res. 22A, 97–108 (1988)Google Scholar
  15. 15.
    Silva, G.P., Cunha, C.B.: Uso da técnica de busca em vizinhançẹ grande porte para a programação da escala de motoristas de ônibus urbano. Transportes 18, 37–45 (2010)Google Scholar
  16. 16.
    Silva, T.A., Silva, G.P.: O uso da metaheurística guided local search para resolver o problema de escala de motoristas de ônibus urbano. Transportes 23, 1–12 (2015)CrossRefGoogle Scholar
  17. 17.
    Silva, G.P., Souza, M.J.F., von Atzingen, J.: Métodos exatos para resolver o problema de programação da tripulação. Transportes 14, 25–32 (2006)Google Scholar
  18. 18.
    Song, C., Guan, W., Ma, J., Liu, T.: Improved genetic algorithm with gene recombination for bus crew scheduling problem. In: Mathematical Problems in Engineering. Hindawi Publishing Corporation, Cairo (2015)CrossRefGoogle Scholar
  19. 19.
    Souza, D.S.: Uma abordagem híbrida para resolver o problema da escala de motoristas de ônibus urbano. Master thesis, Federal University of Ouro Preto, Ouro Preto (2014)Google Scholar
  20. 20.
    Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)CrossRefGoogle Scholar
  21. 21.
    Wren, A.: Scheduling vehicles and their drivers—forty years experience. Technical Report, School of Computing Studies, Leeds University, Leeds (2004)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Leandro do Carmo Martins
    • 1
  • Gustavo Peixoto Silva
    • 2
    Email author
  1. 1.IN3 Department of Computer ScienceOpen University of CataloniaBarcelonaSpain
  2. 2.Department of Computer ScienceFederal University of Ouro Preto, Campus Universitário Morro do CruzeiroOuro PretoBrazil

Personalised recommendations