SJ AB is the leading railway operating company in Sweden and is owned by the Swedish government. In Hagalund train depot (HGL) SJ AB, as well as some of SJ AB:s competitors, run their operational maintenance. The HGL property is owned by Jernhusen but some of the infrastructure is owned by Trafikverket; the Swedish transport administration. The number of depot tracks available for SJ AB have been reduced over time, as competition is increasing. SJ AB constructs their own track plans, i.e. decide the arrival and departure track for each train turnaround in the depot. These track plans are currently made by a so called production planner in the planning system RPS. In RPS the planners base their decisions on common sence, as there is no optimising function in the system. The mathematical problem associated with this task is called the Track Assignment Problem (TAP), which is a well-known problem within railway related research. This report presents an optimisation program - TAP Solver (TAPS) - that takes information from RPS and then generates an optimised solution visualised as a track plan. The user is given the opportunity to direct the solution through parameters in a weight matrix in Excel. TAPS is created to make the process of constructing a track plan both faster and easier. Our results show that TAPS is able to find the optimal 24 hour track plan within a few minutes.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:umu-150265 |
| Date | January 2018 |
| Creators | Hammarstedt, Lovisa, Stefan, Åberg |
| Publisher | Umeå universitet, Institutionen för matematik och matematisk statistik |
| Source Sets | DiVA Archive at Upsalla University |
| Language | Swedish |
| 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.002 seconds