Demonstration of Smart Railway Level Crossing Design and Validation Using Data from Metro Rail, South Africa
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F22%3A39919628" target="_blank" >RIV/00216275:25530/22:39919628 - isvavai.cz</a>
Výsledek na webu
<a href="https://www.hindawi.com/journals/jat/2022/6614242/" target="_blank" >https://www.hindawi.com/journals/jat/2022/6614242/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1155/2022/6614242" target="_blank" >10.1155/2022/6614242</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Demonstration of Smart Railway Level Crossing Design and Validation Using Data from Metro Rail, South Africa
Popis výsledku v původním jazyce
Long waiting time at railway level crossings poses a risk on the safety and affects capacity of rail and road traffic. However, in most cases, the long closing time can be prevented by reducing the time lost at a railway level crossing. The emphasis of this study is to present a numerical optimisation algorithm to reduce the time lost per train trip at a railway level crossing. Thus, attributes with the highest impact on the railway level crossing closing time were extracted from the data analysis of rail-road level crossings on the southern corridor of the Western Cape metro rail. Powell's optimisation algorithm was formulated on the minimisation of the time lost at the railway level crossing per trip. Thus, time lost is constrained by the technical and train's traction constraints. The upper and lower bounds of Powell's algorithm were defined by the threshold closing time in addition to the actual and expected probability density functions. The algorithm was implemented in Matlab. Furthermore, the algorithm was trained on 8000 data sets and tested on 2000 data sets. The developed algorithm proved to be effective and robust in comparison to the current state of railway level crossings under study. Thus, the algorithm was validated to reduce the time lost at the railway level crossing by at least 50%.
Název v anglickém jazyce
Demonstration of Smart Railway Level Crossing Design and Validation Using Data from Metro Rail, South Africa
Popis výsledku anglicky
Long waiting time at railway level crossings poses a risk on the safety and affects capacity of rail and road traffic. However, in most cases, the long closing time can be prevented by reducing the time lost at a railway level crossing. The emphasis of this study is to present a numerical optimisation algorithm to reduce the time lost per train trip at a railway level crossing. Thus, attributes with the highest impact on the railway level crossing closing time were extracted from the data analysis of rail-road level crossings on the southern corridor of the Western Cape metro rail. Powell's optimisation algorithm was formulated on the minimisation of the time lost at the railway level crossing per trip. Thus, time lost is constrained by the technical and train's traction constraints. The upper and lower bounds of Powell's algorithm were defined by the threshold closing time in addition to the actual and expected probability density functions. The algorithm was implemented in Matlab. Furthermore, the algorithm was trained on 8000 data sets and tested on 2000 data sets. The developed algorithm proved to be effective and robust in comparison to the current state of railway level crossings under study. Thus, the algorithm was validated to reduce the time lost at the railway level crossing by at least 50%.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
20104 - Transport engineering
Návaznosti výsledku
Projekt
<a href="/cs/project/EF17_049%2F0008394" target="_blank" >EF17_049/0008394: Spolupráce Univerzity Pardubice a aplikační sféry v aplikačně orientovaném výzkumu lokačních, detekčních a simulačních systémů pro dopravní a přepravní procesy (PosiTrans)</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Ostatní
Rok uplatnění
2022
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Journal of Advanced Transportation
ISSN
0197-6729
e-ISSN
2042-3195
Svazek periodika
2022
Číslo periodika v rámci svazku
February
Stát vydavatele periodika
GB - Spojené království Velké Británie a Severního Irska
Počet stran výsledku
10
Strana od-do
nestrankovano
Kód UT WoS článku
000774326600002
EID výsledku v databázi Scopus
—