Modelo matemático para planejamento da distribuição de locomotivas em pátios ferroviários para atendimento à demanda de formação de trens

• Autor(a) principal: Nascimento, Fabiano Cézar Gomes
• Data de Publicação: 2015
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da Universidade Federal do Espírito Santo (riUfes)
• Texto Completo: http://repositorio.ufes.br/handle/10/3985
• topic: Locomotive Assignment Problem; Locomotives Distribution Planning; Railroad Transport; Space-time Network; Planejamento da Distribuição de Locomotivas; Transporte Ferroviário; Rede espaço-tempo; Engenharia Civil; Locomotivas - Planejamento; Terminais ferroviários; Transporte ferroviário; Modelos matemáticos; Programação inteira; 624

Rail transport has high operating costs and a major challenge is to reduce these costs so that such transport can be competitive. In a railroad there is a vast playing field with opportunities to implement improvements that optimize the use of railroad assets, and one of the main difficulties lies in the locomotives distribution planning in rail yards to meet the demand for trains formation. The major problem of locomotives distribution planning is the situation where there is a demand for locomotive in a certain rail yard in a certain time, but there is not enough locomotives to meet the demand and then it is necessary to move locomotives from one rail yard that has locomotives without demand to this rail yard that has demand. The locomotives can be moved from one rail yard to another in two ways, the first is when it travels coupled to another locomotive that tows, Deadheading, and the second when the locomotive travels alone and can only attach itself to other locomotives, Light Traveling. This paper aims to propose an Integer Programming mathematical model for the Locomotive Assignment Problem, which minimizes the costs of distributing locomotives. The model objective function aims to meet all the locomotive demand, minimizing the distribution costs sum, Deadheading and Light Traveling. In addition, the model prioritizes the distribution of larger capacity locomotives to meet the demand. It is also proposed the introduction of virtual locomotives to meet the demands that have not been met. These locomotives are used to indicate that the demand in that rail yard at certain time will be missed, so that the railroad professionals may take actions in order to deliver locomotives that rail yard and time or assume that demand will not be met. Tests in instances based on real data of the railroad Vitória to Minas (EFVM) were solved optimally using the solver CPLEX 12.6 and proved to be very adherent in operational use for support and decision making with regard to planning and distribution locomotives in rail yards to supply the trains training demand.