Planejamento do transporte de maquinistas para atendimento às locomotivas acopladas em trens

Abstract

To ensure rail transport, several processes are necessary, among them, an important one is the transport of train drivers to work in the locomotives coupled in trains, since it guarantees the availability of a driver to conduct the train. This transport happens because it is necessary to change the driver at the end of his shift by a driver initiating his shift. Thus, it must be provided transportation to the driver from your resting point to the train location and vice versa. Transportation planning should consider the operational and legal requirements of the driver profession. The process of exchanging drivers involves costs related to transport him, number of vehicles needed, and kilometers traveled, and costs related to unproductive hours, generated when the driver is not performing the function of driving the train in the period that includes his work shift. To meet both operational and legal requirements, vehicles must be used, and routes must be drawn to transport the drivers from their resting points to the exchange points or vice versa, at a lower possible transport cost and reducing the number of unproductive hours. To solve the problem mentioned, a mathematical model based on the Dial a Ride Problem (DARP) was proposed. To test the proposed mathematical model, it was applied to the region of the Costa Lacerda Station in Minas Gerais, one of the largest sorting yards of the Vitória-Minas Railroad (EFVM), where approximately 100 train drivers work scale daily. The planning done by the mathematical model achieve better results than the planning realized in an empirical way by the EFVM planners, reducing the costs related to the transport and the unproductive hours.