A modified ant colony optimization algorithm to increase the speed of the road network recovery process after disasters
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73589085" target="_blank" >RIV/61989592:15310/18:73589085 - isvavai.cz</a>
Výsledek na webu
<a href="https://www.sciencedirect.com/science/article/pii/S2212420917304120" target="_blank" >https://www.sciencedirect.com/science/article/pii/S2212420917304120</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ijdrr.2018.04.004" target="_blank" >10.1016/j.ijdrr.2018.04.004</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
A modified ant colony optimization algorithm to increase the speed of the road network recovery process after disasters
Popis výsledku v původním jazyce
When a disaster strikes many roads are blocked and the affected network may break up into a number of isolated parts. The reconnection of the network is therefore necessary for both relief distribution and planning of construction work. Shortening the time during which the road network is separated into isolated parts helps decrease indirect losses from disasters. The obstacles usually faced during the process of reconstruction include both the large number of blocked links and extensive affected areas (road networks). A reduction of the network into a much smaller complete graph and metaheuristic based on an ant colony optimization has been introduced to overcome this issue. We demonstrate that, for small networks, the metaheuristic produces the same results as other deterministic algorithms. We further show that the method is still a viable approach for large networks (723 nodes and 974 links, where we artificially blocked 46 links) when the NP-hard nature of this problem began to affect the computational time of the deterministic algorithms. We demonstrate how the various scenarios can be included into the algorithm. We finally introduce a new ranking of feasible solutions which enables the algorithm to minimize the time of reconstructions for all repair units. Reasonable results were obtained after five minutes of computation. There is nevertheless an up-to-38% improvement of the initial solution. The algorithm can also be used for both relief distribution, when no roads were damaged, and for planning of construction work when damaged roads occur.
Název v anglickém jazyce
A modified ant colony optimization algorithm to increase the speed of the road network recovery process after disasters
Popis výsledku anglicky
When a disaster strikes many roads are blocked and the affected network may break up into a number of isolated parts. The reconnection of the network is therefore necessary for both relief distribution and planning of construction work. Shortening the time during which the road network is separated into isolated parts helps decrease indirect losses from disasters. The obstacles usually faced during the process of reconstruction include both the large number of blocked links and extensive affected areas (road networks). A reduction of the network into a much smaller complete graph and metaheuristic based on an ant colony optimization has been introduced to overcome this issue. We demonstrate that, for small networks, the metaheuristic produces the same results as other deterministic algorithms. We further show that the method is still a viable approach for large networks (723 nodes and 974 links, where we artificially blocked 46 links) when the NP-hard nature of this problem began to affect the computational time of the deterministic algorithms. We demonstrate how the various scenarios can be included into the algorithm. We finally introduce a new ranking of feasible solutions which enables the algorithm to minimize the time of reconstructions for all repair units. Reasonable results were obtained after five minutes of computation. There is nevertheless an up-to-38% improvement of the initial solution. The algorithm can also be used for both relief distribution, when no roads were damaged, and for planning of construction work when damaged roads occur.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10511 - Environmental sciences (social aspects to be 5.7)
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2018
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
International Journal of Disaster Risk Reduction
ISSN
2212-4209
e-ISSN
—
Svazek periodika
31
Číslo periodika v rámci svazku
OCT
Stát vydavatele periodika
NL - Nizozemsko
Počet stran výsledku
14
Strana od-do
1092-1106
Kód UT WoS článku
000446353300101
EID výsledku v databázi Scopus
2-s2.0-85045185220