Identification of road links with the gravest network impacts when blocked concurrently
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F22%3A73615907" target="_blank" >RIV/61989592:15310/22:73615907 - isvavai.cz</a>
Alternative codes found
RIV/44994575:_____/22:N0000008
Result on the web
<a href="https://journals.open.tudelft.nl/ejtir/article/view/5657/5260" target="_blank" >https://journals.open.tudelft.nl/ejtir/article/view/5657/5260</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.18757/ejtir.2022.22.1.5657" target="_blank" >10.18757/ejtir.2022.22.1.5657</a>
Alternative languages
Result language
angličtina
Original language name
Identification of road links with the gravest network impacts when blocked concurrently
Original language description
The identification of a combination of links which can cause the gravest impact on network performance, when interrupted simultaneously, is of great practical importance. The links can be spatially dispersed due to an event such as an earthquake or due to a combination of accidents and disasters. This task is, thus, extremely computationally demanding when applied to real-world networks. We focused on approaches which are both capable of accomplishing this task and where the computational time is acceptable for application in practice. We tested three algorithms based on known heuristic methods: Simulated Annealing (SA), Guided Local Search (GLS) and Variable Neighborhood Search (VNS). The algorithms were modified in the sense of adjusting the searching neighborhood. All the algorithms were subsequently applied to four actual road networks in order to evaluate the impacts of complete simultaneous blockage of four and ten links. The results suggest that the modified SA algorithm identified scenarios with worse consequences than the algorithms based on GLS and VNS. The SA results, for the setting with four interrupted links, were even comparable with those obtained from a deterministic algorithm (which evaluates the entire state space). The algorithm based on SA was also performing best for situations with ten concurrently blocked links. The approach based on SA is thus suitable when modeling the potential impacts of events where a large number of concurrently blocked links is expected. Network managers will thus be able to monitor the immediate state of the network and potential risks related to network disintegration.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
O - Projekt operacniho programu
Others
Publication year
2022
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
Name of the periodical
European Journal of Transport and Infrastructure Research
ISSN
1567-7133
e-ISSN
1567-7141
Volume of the periodical
22
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
30
Pages from-to
63-92
UT code for WoS article
000782846500003
EID of the result in the Scopus database
2-s2.0-85135244637