University of Kashan Mathematics Interdisciplinary Research 2538-3639 9 3 2024 09 01 Simultaneous‎ ‎Location‎ ‎of k Portable Emergency Service Centers and Reconstruction of a Damaged Network 289 314 114477 10.22052/mir.2024.253656.1443 EN Sedigheh Nazari ‎Department of Mathematics, ‎Shahed University,‎ ‎Tehran‎, ‎I‎. ‎R‎. ‎Iran Ardeshir Dolati ‎Department of Computer Sciences, ‎Shahed University,‎ ‎Tehran‎, ‎I‎. ‎R‎. ‎Iran Journal Article 2023 10 15 ‎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‎. https://mir.kashanu.ac.ir/article_114477_6374bbdb1cd684110039f1bd7b4fe43c.pdf