Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21610%2F10%3A00169434" target="_blank" >RIV/68407700:21610/10:00169434 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks
Original language description
Retention levels of road safety barriers are specified on the basis of risk assessment taking into account accidental data and further information available in the Czech Republic and also selected recommendations of Road Safety Association PIARC. The method of Bayesian networks is applied in the analysis and compared with event tree method. Newly proposed classes of retention for several categories of road surroundings considering the intensity of heavy traffic and two levels of hazard situation are incorporated to the revision of national prescriptive document that is expected to enhance the road safety.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JN - Civil engineering
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA103%2F09%2F0693" target="_blank" >GA103/09/0693: Assessment of Safety and Risks of Technical Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Reliability, Risk and Safety. Back to the Future
ISBN
978-0-415-60427-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
Taylor & Francis
Place of publication
London
Event location
Rhodes
Event date
Sep 5, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—