Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/106619
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineeringen_US
dc.creatorGu, Yen_US
dc.creatorRyu, Sen_US
dc.creatorXu, Yen_US
dc.creatorChen, Aen_US
dc.creatorChan, HYen_US
dc.creatorXu, Xen_US
dc.date.accessioned2024-05-20T08:40:44Z-
dc.date.available2024-05-20T08:40:44Z-
dc.identifier.issn0957-4174en_US
dc.identifier.urihttp://hdl.handle.net/10397/106619-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.subjectBi-level programen_US
dc.subjectMulti-link disruptionsen_US
dc.subjectRandom key genetic algorithmen_US
dc.subjectTransportation network vulnerability envelopeen_US
dc.titleA random-key genetic algorithm-based method for transportation network vulnerability envelope analysis under simultaneous multi-link disruptionsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume248en_US
dc.identifier.doi10.1016/j.eswa.2024.123401en_US
dcterms.abstractTransportation 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.accessRightsembargoed accessen_US
dcterms.bibliographicCitationExpert systems with applications, 15 Aug. 2024, v. 248, 123401en_US
dcterms.isPartOfExpert systems with applicationsen_US
dcterms.issued2024-08-15-
dc.identifier.scopus2-s2.0-85185453235-
dc.identifier.eissn1873-6793en_US
dc.identifier.artn123401en_US
dc.description.validate202405 bcchen_US
dc.description.oaNot applicableen_US
dc.identifier.FolderNumbera2710a-
dc.identifier.SubFormID48096-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of China; Smart Cities Research Institute; Research Institute of Land and Spaceen_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2026-08-15en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2026-08-15
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

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.