Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/106619
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Civil and Environmental Engineering | en_US |
dc.creator | Gu, Y | en_US |
dc.creator | Ryu, S | en_US |
dc.creator | Xu, Y | en_US |
dc.creator | Chen, A | en_US |
dc.creator | Chan, HY | en_US |
dc.creator | Xu, X | en_US |
dc.date.accessioned | 2024-05-20T08:40:44Z | - |
dc.date.available | 2024-05-20T08:40:44Z | - |
dc.identifier.issn | 0957-4174 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/106619 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Ltd | en_US |
dc.subject | Bi-level program | en_US |
dc.subject | Multi-link disruptions | en_US |
dc.subject | Random key genetic algorithm | en_US |
dc.subject | Transportation network vulnerability envelope | en_US |
dc.title | A random-key genetic algorithm-based method for transportation network vulnerability envelope analysis under simultaneous multi-link disruptions | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 248 | en_US |
dc.identifier.doi | 10.1016/j.eswa.2024.123401 | en_US |
dcterms.abstract | Transportation network vulnerability envelope (TNVE), constituted by the upper and lower bounds of network performance among all possible disruption scenarios, has recently been proposed as a systematic tool to characterize the impact of simultaneous disruptions of multiple links in a transportation network. Both pessimistic and optimistic cases and the possible range of disruption consequences can be revealed by the TNVE, which can be modeled as a unified optimization problem without the need to enumerate and evaluate all possible disruption scenarios. Specifically, the TNVE problem can be formulated as a binary integer bi-level program (BLP), in which the upper-level problem maximizes/minimizes the remaining network performance under a given number of disrupted links, and the lower-level problem adopts the shortest path problem to check the post-disruption connectivity of each origin–destination (O-D) pair while circumventing the cumbersome path enumeration or path set pre-generation. However, the binary integer BLP is computationally intractable, which hinders the applications of TNVE in practice. This study aims to develop an efficient method based on the random key genetic algorithm (RKGA) for determining the TNVE under simultaneous multi-link disruptions. The main features and benefits of the proposed method include: (a) it simultaneously solves the upper- and lower-bound problems at the same time while guaranteeing the feasibility of all solutions in the solution procedure; (b) it improves the computational efficiency to ensure the applicability to real transportation networks; and (c) it can provide a variety of alternative solutions in addition to the single optimal one, which facilitates the derivation of TNVE buffer and identification of sub-important links. These benefits make the proposed method efficient and effective for solving the TNVE problem. The applicability of the proposed method is demonstrated with small and medium-sized networks, as well as a large-scale real road network. Numerical experiments are conducted to illustrate the usage of TNVE for vulnerability analysis of transportation networks. | en_US |
dcterms.accessRights | embargoed access | en_US |
dcterms.bibliographicCitation | Expert systems with applications, 15 Aug. 2024, v. 248, 123401 | en_US |
dcterms.isPartOf | Expert systems with applications | en_US |
dcterms.issued | 2024-08-15 | - |
dc.identifier.scopus | 2-s2.0-85185453235 | - |
dc.identifier.eissn | 1873-6793 | en_US |
dc.identifier.artn | 123401 | en_US |
dc.description.validate | 202405 bcch | en_US |
dc.description.oa | Not applicable | en_US |
dc.identifier.FolderNumber | a2710a | - |
dc.identifier.SubFormID | 48096 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Natural Science Foundation of China; Smart Cities Research Institute; Research Institute of Land and Space | en_US |
dc.description.pubStatus | Published | en_US |
dc.date.embargo | 2026-08-15 | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Page views
9
Citations as of Jun 30, 2024
SCOPUSTM
Citations
1
Citations as of Jun 27, 2024
WEB OF SCIENCETM
Citations
1
Citations as of Jun 27, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.