{"id":{"repo_id":"aachen","oai_identifier":"oai:publications.rwth-aachen.de:57201"},"canonical_url":"https://search.dev.ndltd.org/etd/aachen/oai:publications.rwth-aachen.de:57201","repository":{"repo_id":"aachen","name":"RWTH Aachen University","base_url":"https://publications.rwth-aachen.de/oai2d"},"display":{"title":"Simulation der Fahrplanerstellung auf der Basis eines hierarchischen Trassenmanagements und Nachweis der Stabilität der Betriebsabwicklung","abstract":"This paper focuses on the further development of the asynchronous method to simulate timetable compilation and railway operation. The newly developed simulation strategy and the use of appropriate basic components introduced in the field of timetable compilation lead to a train priorities respecting simulation procedure that can be used for various stages of the railway planning process. The use of existing basic components enables the procedure to employ infrastructure and timetable data from all over the German network already available. The new asynchronous simulation procedure provides improved solutions for classic questions of railway operation science, such as the calculation of infrastructure capacity or the validation of new timetables and operational concepts. It delivers better results because conflicts between train movements are resolved in a more sophisticated way, particularly on single track lines and in complex networks. This is achieved through automatic choice of alternative train-paths, section-wise resolution of conflicts, and the adaptive calculation of different conflict resolution alternatives where the choice is made with the help of target functions. The paper contains an overview on existing railway operation science models and on timetable compilation methods. The algorithmic complexity of automatic timetable compilation is discussed and corresponding mathematical approaches are analysed. It is demonstrated that, due to the combinatorial variety of possible train sequences and train-path alternatives, mathematical approaches require simplified mathematical modelling structures. However, these simplified modelling structures do not contrib-ute to solve the everyday problems of timetable compilation. Whereas the new procedure is based on concepts similar to the basic ideas of the existing support tool for timetable compilation - namely the idea of occupation times for block sections and the specific consideration of conflicts between train movements - and enables new applications in this area by introducing improved strategies of conflict resolution. As a result, the efficiency of IT supported timetable compilation can be improved as the new method creates various conflict resolution alternatives, searches the existing timetable for free train-paths and inserts additional train paths by using remaining infrastructure capacity in an economical manner. The operation simulation procedure embodied in the new technique makes it possible to check the stability of any timetable and thus to provide early quality assurance of timetable planning processes.","abstract_html":"This paper focuses on the further development of the asynchronous method to simulate timetable compilation and railway operation. The newly developed simulation strategy and the use of appropriate basic components introduced in the field of timetable compilation lead to a train priorities respecting simulation procedure that can be used for various stages of the railway planning process. The use of existing basic components enables the procedure to employ infrastructure and timetable data from all over the German network already available. The new asynchronous simulation procedure provides improved solutions for classic questions of railway operation science, such as the calculation of infrastructure capacity or the validation of new timetables and operational concepts. It delivers better results because conflicts between train movements are resolved in a more sophisticated way, particularly on single track lines and in complex networks. This is achieved through automatic choice of alternative train-paths, section-wise resolution of conflicts, and the adaptive calculation of different conflict resolution alternatives where the choice is made with the help of target functions. The paper contains an overview on existing railway operation science models and on timetable compilation methods. The algorithmic complexity of automatic timetable compilation is discussed and corresponding mathematical approaches are analysed. It is demonstrated that, due to the combinatorial variety of possible train sequences and train-path alternatives, mathematical approaches require simplified mathematical modelling structures. However, these simplified modelling structures do not contrib-ute to solve the everyday problems of timetable compilation. Whereas the new procedure is based on concepts similar to the basic ideas of the existing support tool for timetable compilation - namely the idea of occupation times for block sections and the specific consideration of conflicts between train movements - and enables new applications in this area by introducing improved strategies of conflict resolution. As a result, the efficiency of IT supported timetable compilation can be improved as the new method creates various conflict resolution alternatives, searches the existing timetable for free train-paths and inserts additional train paths by using remaining infrastructure capacity in an economical manner. The operation simulation procedure embodied in the new technique makes it possible to check the stability of any timetable and thus to provide early quality assurance of timetable planning processes.","abstract_has_math":false,"creators":["Gröger, Thomas Andreas"],"institution":"Publikationsserver der RWTH Aachen University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Schwanhäußer, Wulf"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002","date_published":"2002","updated_at":"2026-07-30T19:42:09Z","subjects":["info:eu-repo/classification/ddc/380","Handel, Kommunikation, Verkehr","Eisenbahnbetriebswissenschaft","Fahrplanerstellung","Betriebssimulation"],"languages":["ger"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-119262%22"],"render_values":[{"text":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-119262%22","href":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-119262%22","code":true}]}]},"links":{"outbound_url":"https://publications.rwth-aachen.de/record/57201","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Schwanhäußer, Wulf"]},{"key":"dc:creator","label":"Author","values":["Gröger, Thomas Andreas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:coverage","label":"Dc Coverage","values":["DE"]},{"key":"dc:date","label":"Dc Date","values":["2002"]},{"key":"dc:publisher","label":"Institution","values":["Publikationsserver der RWTH Aachen University"]},{"key":"dc:relation","label":"Dc Relation","values":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-4660"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["info:eu-repo/classification/ddc/380","Handel, Kommunikation, Verkehr","Eisenbahnbetriebswissenschaft","Fahrplanerstellung","Betriebssimulation"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["ger"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/record/57201","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-119262%22"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This paper focuses on the further development of the asynchronous method to simulate timetable compilation and railway operation. The newly developed simulation strategy and the use of appropriate basic components introduced in the field of timetable compilation lead to a train priorities respecting simulation procedure that can be used for various stages of the railway planning process. The use of existing basic components enables the procedure to employ infrastructure and timetable data from all over the German network already available. The new asynchronous simulation procedure provides improved solutions for classic questions of railway operation science, such as the calculation of infrastructure capacity or the validation of new timetables and operational concepts. It delivers better results because conflicts between train movements are resolved in a more sophisticated way, particularly on single track lines and in complex networks. This is achieved through automatic choice of alternative train-paths, section-wise resolution of conflicts, and the adaptive calculation of different conflict resolution alternatives where the choice is made with the help of target functions. The paper contains an overview on existing railway operation science models and on timetable compilation methods. The algorithmic complexity of automatic timetable compilation is discussed and corresponding mathematical approaches are analysed. It is demonstrated that, due to the combinatorial variety of possible train sequences and train-path alternatives, mathematical approaches require simplified mathematical modelling structures. However, these simplified modelling structures do not contrib-ute to solve the everyday problems of timetable compilation. Whereas the new procedure is based on concepts similar to the basic ideas of the existing support tool for timetable compilation - namely the idea of occupation times for block sections and the specific consideration of conflicts between train movements - and enables new applications in this area by introducing improved strategies of conflict resolution. As a result, the efficiency of IT supported timetable compilation can be improved as the new method creates various conflict resolution alternatives, searches the existing timetable for free train-paths and inserts additional train paths by using remaining infrastructure capacity in an economical manner. The operation simulation procedure embodied in the new technique makes it possible to check the stability of any timetable and thus to provide early quality assurance of timetable planning processes."]},{"key":"dc:source","label":"Dc Source","values":["Aachen : Publikationsserver der RWTH Aachen University 181 S. : Ill., graph. Darst. (2002). = Aachen, Techn. Hochsch., Diss., 2002"]},{"key":"dc:title","label":"Title","values":["Simulation der Fahrplanerstellung auf der Basis eines hierarchischen Trassenmanagements und Nachweis der Stabilität der Betriebsabwicklung"]}]}],"canonical_facts":{"dc:contributor":["Schwanhäußer, Wulf"],"dc:coverage":["DE"],"dc:creator":["Gröger, Thomas Andreas"],"dc:date":["2002"],"dc:description":["This paper focuses on the further development of the asynchronous method to simulate timetable compilation and railway operation. The newly developed simulation strategy and the use of appropriate basic components introduced in the field of timetable compilation lead to a train priorities respecting simulation procedure that can be used for various stages of the railway planning process. The use of existing basic components enables the procedure to employ infrastructure and timetable data from all over the German network already available. The new asynchronous simulation procedure provides improved solutions for classic questions of railway operation science, such as the calculation of infrastructure capacity or the validation of new timetables and operational concepts. It delivers better results because conflicts between train movements are resolved in a more sophisticated way, particularly on single track lines and in complex networks. This is achieved through automatic choice of alternative train-paths, section-wise resolution of conflicts, and the adaptive calculation of different conflict resolution alternatives where the choice is made with the help of target functions. The paper contains an overview on existing railway operation science models and on timetable compilation methods. The algorithmic complexity of automatic timetable compilation is discussed and corresponding mathematical approaches are analysed. It is demonstrated that, due to the combinatorial variety of possible train sequences and train-path alternatives, mathematical approaches require simplified mathematical modelling structures. However, these simplified modelling structures do not contrib-ute to solve the everyday problems of timetable compilation. Whereas the new procedure is based on concepts similar to the basic ideas of the existing support tool for timetable compilation - namely the idea of occupation times for block sections and the specific consideration of conflicts between train movements - and enables new applications in this area by introducing improved strategies of conflict resolution. As a result, the efficiency of IT supported timetable compilation can be improved as the new method creates various conflict resolution alternatives, searches the existing timetable for free train-paths and inserts additional train paths by using remaining infrastructure capacity in an economical manner. The operation simulation procedure embodied in the new technique makes it possible to check the stability of any timetable and thus to provide early quality assurance of timetable planning processes."],"dc:identifier":["https://publications.rwth-aachen.de/record/57201","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-119262%22"],"dc:language":["ger"],"dc:publisher":["Publikationsserver der RWTH Aachen University"],"dc:relation":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-4660"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:source":["Aachen : Publikationsserver der RWTH Aachen University 181 S. : Ill., graph. Darst. (2002). = Aachen, Techn. Hochsch., Diss., 2002"],"dc:subject":["info:eu-repo/classification/ddc/380","Handel, Kommunikation, Verkehr","Eisenbahnbetriebswissenschaft","Fahrplanerstellung","Betriebssimulation"],"dc:title":["Simulation der Fahrplanerstellung auf der Basis eines hierarchischen Trassenmanagements und Nachweis der Stabilität der Betriebsabwicklung"],"dc:type":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]},"updated_at":"2026-07-30T19:42:09Z"}