101. Simultaneous Location of k Portable Emergency Service Centers and Reconstruction of a Damaged Network
- Author
-
Sedigheh Nazari and Ardeshir Dolati
- Subjects
facility location problem ,k-center problem ,portable k-center problem ,Mathematics ,QA1-939 - Abstract
This paper addresses the problem of optimizing the reconstruction of links in a network in the aftermath of natural disasters or human errors, such as landslides, floods, storms, earthquakes, bombing, war, etc. We aim to determine the optimal sequence for reconstructing the destroyed links within a specific time horizon, while simultaneously locating (k) portable emergency service centers (where (k > 2) throughout the entire network. In this paper, the problem is considered in a tree structure. A greedy algorithm and a heuristic method, namely, maximum radius, are proposed to solve the problem. We evaluate the performance of the proposed algorithms using randomly generated data. The experimental results confirm the effectiveness of the proposed methods.
- Published
- 2024
- Full Text
- View/download PDF