A Target-Barrier Repairment Algorithm
Funan Peng, Li Lv, Gufeng Wei, Jun Wang · 2024
In this paper, we focus on the shortest repair path problem for target-barrier. Firstly, an S-elite centroid opposition-based (SCO) learning mechanism is designed, thereby enhancing the diversity of candidate solutions. The SCO learning mechanism is incorporated into the Kepler optimized algorithm (KOA)'s elite solution screening process. Additionally, Discretized S- Elite Centroid Opposition-based learning KOA (DSCOKOA), a discretization scheme tailored to the shortest repair path problem is designed, converting the originally continuous problem-solving KOA algorithm into one that can handle discretization problems. Considering the scenario where close to the target is not allowed, the repair path should bypass the safety range set around the target. This is treated as an obstacle, and the path is preprocessed before repair to ultimately provide the shortest path repair solution.