Fernando A Lepe-Silva

Mr. Fernando A Lepe-Silva

Escuela de informatica, Pontificia Universidad Catolica de Valparaiso, Valparaíso, Chile
orcid
Magister

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 October 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
Fernando A Lepe-SilvaFernando A Lepe-Silva
Fernando A Lepe-Silva
Broderick CrawfordBroderick Crawford
Broderick Crawford
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
JBJosé Carlos Barrera-García
José Carlos Barrera-García
Ricardo SotoRicardo Soto
Ricardo Soto
This research presents a novel hybrid approach, which combines the White Shark Optimizer (WSO) metaheuristic algorithm with chaotic maps integrated into the binarization process. Inspired by the predatory behavior of white sharks, WSO has shown great potential to navigate complex search spaces for optimization tasks. On the other hand, chaotic maps are nonlinear dynamical systems that generate pseudo-random sequences, allowing for better solution diversification and avoiding local optima. By hybridizing WSO and chaotic maps through adaptive binarization rules, the complementary strengths of both approaches are leveraged to obtain high-quality solutions. We have solved the Set Covering Problem (SCP), a well-known NP-hard combinatorial optimization challenge with real-world applications in several domains, and experimental results indicate that LOG and TENT chaotic maps are better after statistical testing. This hybrid approach could have practical applications in telecommunication network optimization, transportation route planning, and resource-constrained allocation.

3 July 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
PZPablo Zúñiga-Valenzuela
Pablo Zúñiga-Valenzuela
Broderick CrawfordBroderick Crawford
Broderick Crawford
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
Eduardo Rodriguez-TelloEduardo Rodriguez-Tello
Eduardo Rodriguez-Tello
Ricardo SotoRicardo Soto
Ricardo Soto
Fernando A Lepe-SilvaFernando A Lepe-Silva
Fernando A Lepe-Silva
The Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe. This study introduces a binary White Shark Optimizer (WSO) enhanced with V3 transfer functions, elitist binarization, and chaotic maps. To evaluate algorithm performance, we employ the Relative Percentage Deviation (RPD), which measures the percentage difference between the obtained solutions and optimal values. Our approach achieves outstanding results on six benchmark instances: WSO-ELIT_CIRCLE delivers an RPD of 0.7% for structured instances, while WSO-ELIT_SINU attains an RPD of 0.96% in cyclic instances, showing empirical improvements over standard methods. Experimental results demonstrate that circle chaotic maps excel in structured problems, while sinusoidal maps perform optimally in cyclic instances, with observed improvements up to 7.31% over baseline approaches. Diversity and convergence analyses show structured instances favor exploitation-driven strategies, whereas cyclic instances benefit from adaptive exploration. This work establishes WSO as a robust metaheuristic for USCP, with applications in resource allocation and network design.