Identification of road links with the gravest network impacts when blocked concurrently

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/44994575:_____/22:N0000008

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Identification of road links with the gravest network impacts when blocked concurrently

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Identification of road links with the gravest network impacts when blocked concurrently

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

O - Projekt operacniho programu

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ů

Název periodika

European Journal of Transport and Infrastructure Research

ISSN

1567-7133

e-ISSN

1567-7141

Svazek periodika

22

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

30

Strana od-do

63-92

Kód UT WoS článku

000782846500003

EID výsledku v databázi Scopus

2-s2.0-85135244637