FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W10670084> ?p ?o ?g. }

• W10670084 abstract "Railway networks, such as the one in the Netherlands, form an important means of transportation, both for passengers, as well as for transporting goods. Train services carrying passengers often run according to a predefined schedule or timetable. When those train services are delayed, for example due to accidents or malfunctioning rolling stock, the affected train may not be able to run according to schedule any longer. When the railway network is dense and hosts different kinds of services, such as local and intercity services, this initial delay is easily passed on to other train services in the network, due to different stopping patterns and drive speeds. Human dispatchers, possibly aided by computer systems, make temporary modifications to the way the network is used by the trains running in the region of the disturbance. However, due to the high complexity and the limited time, these decisions may be optimal for only the designated area of the dispatcher, but far from optimal from a network perspective. Therefore, a railway network operator could have a major benefit from a system able to compute globally optimal decisions in the case of disturbances. This thesis is written as part of the development of such a system. Specifically, this project aims at applying Model Predictive Control (MPC) to railway networks. In MPC, a model of the system is used to predict the future behaviour of the system within a prediction horizon. The principle of receding horizon control is employed to compute an optimal future input sequence, such that a certain cost is minimized. This cost is the total delay in the network within the prediction horizon. The inputs of the controlled system are associated to the order of a train pair on a track. Train orders can be swapped at stations and junctions. As there are many of those points present in the network, swapping orders offers the most possibilities and is effective in a wide range of delay scenarios. Therefore, in this thesis only order swaps are considered. The system is modelled within a max-plus algebraic framework, which allows for a structured representation and systematic approach, where the latter is especially useful for future endeavours to exploit max-plus system theory, such that for example model reduction can be applied to the generally very large railway models. The algorithm presented in this thesis forms the basis for an MPC algorithm for railway networks. The development of a tailor made receding horizon control algorithm for railway networks, has not been carried out before. First an extension of the existing maxplus linear model is presented, such that a model which is uncertain in the parameters is obtained. This model already contains controllable train orders. The problem of finding the optimal order swaps, such that the total delay in the network is minimal, can be written as a Mixed Integer Linear Programming problem. Several test cases were derived to highlight the various aspects of the receding horizon control algorithm, such as how it copes with different parameter estimations at various points in time. Through the use of a time-based control horizon, a significant reduction in computation time was achieved an provides a very good method to overcome the computational complexity encountered during optimal control of railway networks. Although the prediction horizon is defined in the discrete event domain, the algorithm is easily modified to also contain a time-based prediction horizon, allowing for more freedom in tuning of the prediction horizon and thus also computation times." @default.
• W10670084 created "2016-06-24" @default.
• W10670084 creator A5034647018 @default.
• W10670084 date "2012-05-22" @default.
• W10670084 modified "2023-09-27" @default.
• W10670084 title "Receding Horizon Control of Perturbed Railway Network Operation" @default.
• W10670084 hasPublicationYear "2012" @default.
• W10670084 type Work @default.
• W10670084 sameAs 10670084 @default.
• W10670084 citedByCount "0" @default.
• W10670084 crossrefType "journal-article" @default.
• W10670084 hasAuthorship W10670084A5034647018 @default.
• W10670084 hasConcept C104317684 @default.
• W10670084 hasConcept C111919701 @default.
• W10670084 hasConcept C114809511 @default.
• W10670084 hasConcept C126255220 @default.
• W10670084 hasConcept C127413603 @default.
• W10670084 hasConcept C154945302 @default.
• W10670084 hasConcept C158448853 @default.
• W10670084 hasConcept C17020691 @default.
• W10670084 hasConcept C172205157 @default.
• W10670084 hasConcept C185592680 @default.
• W10670084 hasConcept C190839683 @default.
• W10670084 hasConcept C205649164 @default.
• W10670084 hasConcept C2775924081 @default.
• W10670084 hasConcept C28761237 @default.
• W10670084 hasConcept C33923547 @default.
• W10670084 hasConcept C41008148 @default.
• W10670084 hasConcept C42475967 @default.
• W10670084 hasConcept C55493867 @default.
• W10670084 hasConcept C58640448 @default.
• W10670084 hasConcept C68387754 @default.
• W10670084 hasConcept C86339819 @default.
• W10670084 hasConcept C91575142 @default.
• W10670084 hasConceptScore W10670084C104317684 @default.
• W10670084 hasConceptScore W10670084C111919701 @default.
• W10670084 hasConceptScore W10670084C114809511 @default.
• W10670084 hasConceptScore W10670084C126255220 @default.
• W10670084 hasConceptScore W10670084C127413603 @default.
• W10670084 hasConceptScore W10670084C154945302 @default.
• W10670084 hasConceptScore W10670084C158448853 @default.
• W10670084 hasConceptScore W10670084C17020691 @default.
• W10670084 hasConceptScore W10670084C172205157 @default.
• W10670084 hasConceptScore W10670084C185592680 @default.
• W10670084 hasConceptScore W10670084C190839683 @default.
• W10670084 hasConceptScore W10670084C205649164 @default.
• W10670084 hasConceptScore W10670084C2775924081 @default.
• W10670084 hasConceptScore W10670084C28761237 @default.
• W10670084 hasConceptScore W10670084C33923547 @default.
• W10670084 hasConceptScore W10670084C41008148 @default.
• W10670084 hasConceptScore W10670084C42475967 @default.
• W10670084 hasConceptScore W10670084C55493867 @default.
• W10670084 hasConceptScore W10670084C58640448 @default.
• W10670084 hasConceptScore W10670084C68387754 @default.
• W10670084 hasConceptScore W10670084C86339819 @default.
• W10670084 hasConceptScore W10670084C91575142 @default.
• W10670084 hasLocation W106700841 @default.
• W10670084 hasOpenAccess W10670084 @default.
• W10670084 hasPrimaryLocation W106700841 @default.
• W10670084 hasRelatedWork W1815361394 @default.
• W10670084 hasRelatedWork W1963889071 @default.
• W10670084 hasRelatedWork W2031545009 @default.
• W10670084 hasRelatedWork W2039435134 @default.
• W10670084 hasRelatedWork W2068979195 @default.
• W10670084 hasRelatedWork W2069722194 @default.
• W10670084 hasRelatedWork W2083566211 @default.
• W10670084 hasRelatedWork W2141206235 @default.
• W10670084 hasRelatedWork W2179009945 @default.
• W10670084 hasRelatedWork W2565819425 @default.
• W10670084 hasRelatedWork W2739539665 @default.
• W10670084 hasRelatedWork W2794224859 @default.
• W10670084 hasRelatedWork W2808355842 @default.
• W10670084 hasRelatedWork W2897061334 @default.
• W10670084 hasRelatedWork W3015095742 @default.
• W10670084 hasRelatedWork W3089207429 @default.
• W10670084 hasRelatedWork W3163928528 @default.
• W10670084 hasRelatedWork W3196319687 @default.
• W10670084 hasRelatedWork W949847523 @default.
• W10670084 hasRelatedWork W2135854919 @default.
• W10670084 isParatext "false" @default.
• W10670084 isRetracted "false" @default.
• W10670084 magId "10670084" @default.
• W10670084 workType "article" @default.