Um Modelo de Otimização para um Problema Real de Programação de Horários de Trens Urbanos

• Renata Mendes UFPB
• Anand Subramanian UFPB
• Bruno Bruck UFPB
• Teobaldo Bulhões UFPB

DOI: https://doi.org/10.5753/etc.2023.230687

Abstract

This work is a result of a collaboration with a Brazilian train company that uses a single track in its rail network, where trains can travel in both directions. This is a train scheduling problem, in which the goal is not only to generate a daily timetable for the railway line, in order to better satisfy the users of the transport network, but also to assign pre-made routes for such vehicles. To this end, a mathematical formulation was proposed in order to portray the problem effectively. The developed model was capable of finding feasible solutions, as well as optimal values for small-size and medium-size instances.

References

Barrena, E., Canca, D., Coelho, L. C., and Laporte, G. (2014). Exact formulations and algorithm for the train timetabling problem with dynamic demand. Computers & Operations Research, 44:66–74.

Caprara (2002). Modeling and solving the train timetabling problem. Operations Research, 50(5):851–861.

Khan, M. B. and Zhou, X. (2010). Stochastic optimization model and solution algorithm for robust double-track train-timetabling problem. IEEE Transactions on Intelligent Transportation Systems, 11(1):81–89.

Szpigel, B. (1973). Optimal ttain scheduling on a single line railway. Operational research, 72:343–352.

Zhou, X. and Zhong, M. (2006). Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B Methodological, 41(3):320–341.