A heuristic approach for the distance-based critical node detection problem in complex networks
| Autor: | Kerem Akartunali, Ashwin Arulselvan, Eduardo L. Pasiliao, Glory Uche Alozie |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: |
Marketing
021103 operations research Theoretical computer science Heuristic Computer science Strategy and Management Node (networking) Breadth-first search 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Complex network Measure (mathematics) Management Information Systems HD61 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Heuristics Centrality Distance based |
| ISSN: | 0160-5682 |
| Popis: | The distance-based critical node problem involves identifying a subset of nodes in a network whose removal minimises a pre-defined distance-based connectivity measure. Having the classical critical node problem as a special case, the distance-based critical node problem is computationally challenging. In this article, we study the distance-based critical node problem from a heuristic algorithm perspective. We consider the distance-based connectivity objective whose goal is to minimise the number of node pairs connected by a path of length at most k, subject to budgetary constraints. We propose a centrality based heuristic which combines a backbone-based crossover procedure to generate good offspring solutions and a centrality-based neighbourhood search to improve the solution. Extensive computational experiments on real-world and synthetic graphs show the effectiveness of the developed heuristic in generating good solutions when compared to exact solution. Our empirical results also provide useful insights for future algorithm development. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|