A Target-Barrier Repairment Algorithm

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.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/iccc62609.2024.10942070
Citations
1
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Target-Barrier Repairment Algorithm

Li Lv, Funan Peng, Guanghua Wei, Jun Wang
1 citations
Optimization and Search Problems
0.35
article

A Target-Barrier Repairment Algorithm

Li Lv, Funan Peng, Guanghua Wei, Jun Wang
article en
1 citations

Abstract

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.

Shenyang Institute of Computing Technology (China) (CN), University of Chinese Academy of Sciences (CN), Shenyang University of Chemical Technology (CN)
Openalex Percentile: Top 33%
Optimization and Search Problems
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.