Planning the assignment of train drivers to long distance travel trains on freight transport railways

Authors

  • Franco Collodetti Mazioli Universidade Federal do Espírito Santo, Espírito Santo – Brasil
  • Rodrigo de Alvarenga Rosa Universidade Federal do Espírito Santo, Espírito Santo – Brasil http://orcid.org/0000-0003-0841-514X
  • Matheus da Silva Gravel Vale S.A. – Brasil
  • Vivian Parreira Vale S.A. – Brasil

DOI:

https://doi.org/10.14295/transportes.v28i4.2027

Keywords:

Crew management. Railway optimization. Railway operation. Railway transport.

Abstract

Brazilian railroads carry loads through very long trips. A train is driven by a driver and, due to the long trips, the total trip time of the trains is generally higher than the period of the driver's shift and, thus it is necessary to change drivers during the trip in predefined places, called detachments. In the literature, this problem is solved separately by two subproblems: Crew Scheduling and Crew Rostering. Differently, this paper proposes a mathematical model to solve the two subproblems in an integrated way, inspired by the Vehicle Routing Problem of with Multiple Trips and Multiple Depots, to plan the designation of train drivers to drive the trains that will pass through the detachments aiming to minimize the cost with the payment of train drivers. Results show possible cost reductions when compared to the manual planning of the analyzed railway and increasing the shift period, cost reductions can be achieved.

Downloads

Download data is not yet available.

Author Biographies

Franco Collodetti Mazioli, Universidade Federal do Espírito Santo, Espírito Santo – Brasil

Mestre em Engenharia Civil pela UFES. Engenheiro Civil pela UFES.

Rodrigo de Alvarenga Rosa, Universidade Federal do Espírito Santo, Espírito Santo – Brasil

Pesquisador CNPq-2 (Transportes). Pós Doutor no Programa de Engenharia de Transportes (PET) na COPPE/UFRJ. Doutor em Engenharia Elétrica pela Universidade Federal do Espírito Santo (UFES) (2006). Mestre em Informática pela UFES (1996). Graduado em Engenharia Civil pela UFES (1989). Professor associado no Depart. Eng. Produção da UFES; Professor permanente do Mestrado de Engenharia Civil (UFES) - Área de Transportes.

Matheus da Silva Gravel, Vale S.A. – Brasil

Engenheiro da Estrada de Ferro Vitória Minas, Vale S/A. Mestrando em Eng. Civil pela UFES. Engenheiro de Produção Univ. Federal Juiz de Fora.

Vivian Parreira, Vale S.A. – Brasil

Engenheiro da Estrada de Ferro Vitória Minas, Vale S/A. Pós-Graduada em Engenharia Ferroviária, Multivix. Engenheira de Produção, FAESA.

References

ANTT - Agência Nacional de Transportes Terrestres (2018). Disponível em: http://www.antt.gov.br/. (Acessado em: 06 de janeiro de 2018).

Braekers, K.; K. Ramaekers e I. V. Nieuwenhuyse (2016). The vehicle routing problem: State of the art classification and re-view. Computers & Industrial Engineering, v. 99, p. 300-313. DOI: 10.1016/j.cie.2015.12.007

Caprara, A.; M. Fischetti; P. Toth; D. Vigo e P. L. Guida (1997). Algorithms for railway crew management. Mathematical Pro-gramming, v. 79, n. 1-3, p. 125-141. DOI: 10.1007/BF02614314

Caprara, A.; M. Fischetti e P. Toth (1999). A heuristic method for the set covering problem. Operations Research, v. 47, n. 5, p. 730-743. DOI: 10.1287/opre.47.5.730.

CNT. Confederação Nacional do Transporte. Anuário CNT do Transporte 2017 – Estatísticas Consolidadas. Disponível em: http://anuariodotransporte.cnt.org.br/. (Acesso em: 02 de fevereiro de 2018).

Ernst, A. T.; H. Jiang; M. Krishnamoorthy; H. Nott e D. Sier (2001). An integrated optimization model for train crew manage-ment. Annals of Operations Research, v. 108, n. 1-4, p. 211-224. DOI: 10.1023/A:1016019314196

Hanafi, R. e E. Kozan (2014). A hybrid constructive heuristic and simulated annealing for railway crew schedul-ing. Computers & Industrial Engineering, v. 70, p. 11-19. DOI: 10.1016/j.cie.2014.01.002

IBM. IBM ILOG CPLEX Optimization Studio 12.6. Using Logical Constraints. Disponível em: https://www.ibm.com/support/knowledgecenter/pt-br/SSSA5P_ 12.7.1/ilog.odms.ide.help/OPL_Studio/opllanguser/topics/opl_languser_app_areas_ cplex_using.html. (Acesso em: 17 nov. 2017).

Jütte, S.; M. Albers; U. W. Thonemann e K. Haase (2011). Optimizing railway crew scheduling at DB Schenker. Interfaces, v. 41, n. 2, p. 109-122. DOI: 10.1287/inte.1100.0549

Juette, S. e U. W. Thonemann (2012). Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems. European Journal of Operational Research, v. 219, n. 2, p. 214-223. DOI: 10.1016/j.ejor.2011.12.038

Jütte, S. e U. W. Thonemann (2015). A graph partitioning strategy for solving large-scale crew scheduling problems. OR Spec-trum, v. 37, n. 1, p. 137-170. DOI: 10.1007/s00291-014-0381-8

Lin, C.; K. L. Choy; G. T. Ho; S. H. Chung e H. Y. Lam (2014). Survey of green vehicle routing problem: past and future trends. Expert Systems With Applications, v. 41, n. 4, p. 1118-1138. DOI: 10.1016/j.eswa.2013.07.107

Downloads

Published

2020-11-16

How to Cite

Mazioli, F. C., Rosa, R. de A., Gravel, M. da S., & Parreira, V. (2020). Planning the assignment of train drivers to long distance travel trains on freight transport railways. Transportes, 28(4), 20–37. https://doi.org/10.14295/transportes.v28i4.2027

Issue

Vol. 28 No. 4 (2020): Prêmio ANPET Produção Científica 2019

Section

Prêmio ANPET de Produção Científica winners

License

Authors who submit papers for publication by TRANSPORTES agree to the following terms:

  1. The authors retain the copyright and grant Transportes the right of first publication of the manuscript, without any financial charge, and waive any other remuneration for its publication by ANPET.
  2. Upon publication by Transportes, the manuscript is automatically licensed under the Creative Commons License CC BY 4.0 license. This license permits the work to be shared with proper attribution to the authors and its original publication in this journal.
  3. Authors are authorized to enter into additional separate contracts for the non-exclusive distribution of the version of the manuscript published in this journal (e.g., publishing in an institutional repository or as a book chapter), with recognition of the initial publication in this journal, provided that such a contract does not imply an endorsement of the content of the manuscript or the new medium by ANPET.
  4. Authors are permitted and encouraged to publish and distribute their work online (e.g., in institutional repositories or on their personal websites) after the editorial process is complete. As Transportes provides open access to all published issues, authors are encouraged to use links to the DOI of their article in these cases.
  5. Authors guarantee that they have obtained the necessary authorization from their employers for the transfer of rights under this agreement, if these employers hold any copyright over the manuscript. Additionally, authors assume all responsibility for any copyright infringements by these employers, releasing ANPET and Transportes from any responsibility in this regard.
  6. Authors assume full responsibility for the content of the manuscript, including the necessary and appropriate authorizations for the disclosure of collected data and obtained results, releasing ANPET and Transportes from any responsibility in this regard.