An Adaptive Large Neighborhood Search Heuristic to Solve the Crew Scheduling Problem
- 432 Downloads
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.
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.
- 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
- 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
- 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.Smith, B.M., Wren, A.: A bus crew scheduling system using a set covering formulation. Transp. Res. 22A, 97–108 (1988)Google Scholar
- 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
- 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
- 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
- 21.Wren, A.: Scheduling vehicles and their drivers—forty years experience. Technical Report, School of Computing Studies, Leeds University, Leeds (2004)Google Scholar