A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem

DOI10.1016/j.cor.2023.106363OpenAlexW4385497617MaRDI QIDQ6068690

Antonino Sgalambro, Donatella Granata

Publication date: 13 November 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106363

zbMATH Keywords

metaheuristicsnetworksmixed integer programmingcritical disruption pathmultiple objective optimisation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Network interdiction through length-bounded critical disruption paths: a bi-objective approach
• Network interdiction via a critical disruption path: branch-and-price algorithms
• A derandomized approximation algorithm for the critical node detection problem
• Complexity of the critical node problem over trees
• The complexity of finding two disjoint paths with min-max objective function
• Matching interdiction
• Vulnerability of complex networks
• Detecting critical nodes in sparse graphs
• The directed subgraph homeomorphism problem
• Variable neighborhood search
• The disjoint shortest paths problem
• The maximum clique interdiction problem
• The critical node detection problem in networks: a survey
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Deterministic network interdiction
• Finding the most vital arcs in a network
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• A survey of network interdiction models and algorithms
• Epidemic dynamics on complex networks
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• A Fast Greedy Algorithm for the Critical Node Detection Problem
• A quick method for finding shortest pairs of disjoint paths
• From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods
• A Polynomial Solution to the Undirected Two Paths Problem
• Disjoint paths in a network
• On the Computational Complexity of Combinatorial Problems
• Variable neighborhood search for the p-median
• Detecting critical node structures on graphs: A mathematical programming approach
• Minimum vertex blocker clique problem
• Shortest-path network interdiction
• Multi‐objective optimization using metaheuristics: non‐standard algorithms
• Removing Arcs from a Network
• Evolutionary Multi-Criterion Optimization
• Evolutionary Multi-Criterion Optimization