The goal of this project is to implement and verify an optimization model for finding a min-cost selection of switches and train paths at railway stations. The selected train paths must satisfy traffic requirements that commonly apply to regular railway traffic. The requirements include different combinations of simultaneous and overtaking train movements. The model does not rely on timetables but does instead utilize different path sets that are produced via algorithms based on a network representation of the station layout. The model has been verified on a small test station and also on the real station layout at Katrineholm. These tests show that the model can solve the problem for mid size stations with through traffic. In addition, we have performed a literature study regarding maintenance problems for switches and crossings. We have also looked at articles regarding the scheduling and routing of trains through railway stations. Finally we present some possible ways to further improve the model for more realistic experiments.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-177613 |
| Date | January 2021 |
| Creators | Olsson, Sam |
| Publisher | Linköpings universitet, Tillämpad matematik, Linköpings universitet, Tekniska fakulteten |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0024 seconds