simultaneous‎ ‎location‎ ‎of k portable emergency service centers and reconstruction of a damaged network

‎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‎.