Programação de trens em linhas singelas
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Universidade Federal de Juiz de Fora (UFJF)
DOI
Abstract
The good planning of the train timetable in a railroad is needed to reduce the wasted
time of the trains, and also to make them arrive as soon as possible at their destinies.
However, the computer tools existing to solve this problem requires a great amount of
processing time, making the fast solution generation infeasible. This paper modeled the
problem using integer linear program and proposed an algorithm to solve it using an heuristic,
which is based on the relaxation of some constrains that could happen after a certain time
horizon. After testing different scenarios, the proposed method revealed capable of generate
the optimal solution in a few seconds.
Description
Keywords
Citation
Collections
Endorsement
Review
Supplemented By
Referenced By
Rights and licensing
Acesso Aberto
