Abstract
Connectivity is one of the essential needs in today’s standards in many aspects of life, starting with personal relationships, education, and remote work and ending with the security and economy of countries. However, connectivity is susceptible to intentional and unintentional disruptions, leading to great impact on critical infrastructures. Hence, maintaining connectivity is a crucial task to sustain the continuous flow of life. The challenge is to find an optimal recovery plan to reconnect all demands as soon as possible after the disruptive event, ensuring fairness in the process of reallocating the remaining resources. In this paper, we present a post-disruption recovery framework for networked systems to optimize the recovery plan to reconnect the network demands as soon as possible. More specifically, we introduce an algorithmic approach using a mathematical programming model that optimally recovers the disrupted arcs of the network while ensuring the highest connectivity. The proposed approach considers both fairness and efficiency through finding the MMF (max-min fairness) resource allocation throughout the recovery process. The proposed approach is tested on a variety of benchmark networks under a set of disruption levels; then, the results are compared with the maximum-flow model.
| Original language | English |
|---|---|
| Article number | 3112 |
| Journal | Mathematics |
| Volume | 13 |
| Issue number | 19 |
| DOIs | |
| State | Published - Oct 2025 |
Bibliographical note
Publisher Copyright:© 2025 by the authors.
Keywords
- fairness in resource allocation
- goal programming
- load balancing
- max-min fairness
- the direct progressive-filling algorithm
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Mathematics
- Engineering (miscellaneous)