Aggregation Methods for Railway Networks
Please always quote using this URN: urn:nbn:de:0297-zib-11881
- In this paper a bottom-up approach of automatic simplification of a railway network is presented. Starting from a very detailed, microscopic level, as it is used in railway simulation, the network is transformed by an algorithm to a less detailed level (macroscopic network), that is sufficient for long-term planning and optimization. In addition running and headway times are rounded to a pre-chosen time discretization by a special cumulative method, which we will present and analyse in this paper. After the transformation we fill the network with given train requests to compute an optimal slot allocation. Then the optimized schedule is re-transformed into the microscopic level and can be simulated without any conflicts occuring between the slots. The algorithm is used to transform the network of the very dense Simplon corridor between Swiss and Italy. With our aggregation it is possible for the first time to generate a profit maximal and conflict free timetable for the corridor across a day by a simultaneously optimization run.
Author: | Ralf BorndörferORCiD, Berkan Erol, Thomas Graffagnino, Thomas Schlechte, Elmar Swarat |
---|---|
Document Type: | ZIB-Report |
Tag: | Netzwerkaggregation; makroskopische Bahnmodellierung macroscopic railway modeling; network aggregation |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B06 Transportation, logistics |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B20 Traffic problems | |
91-XX GAME THEORY, ECONOMICS, SOCIAL AND BEHAVIORAL SCIENCES / 91Bxx Mathematical economics (For econometrics, see 62P20) / 91B74 Models of real-world systems | |
Creating Corporation: | Zuse Institut Berlin |
Date of first Publication: | 2010/11/01 |
Series (Serial Number): | ZIB-Report (10-23) |
ISSN: | 1438-0064 |
ZIB-Reportnumber: | 10-23 |
Published in: | A rev. vers. appeared in: Journal of Rail Transport Planning & Management 1(2011) 38-48 |
URL: | http://www.sciencedirect.com/science/article/pii/S2210970611000047 |