Binary Chaotic White Shark Optimizer for the Unicost Set Covering Problem

Binary Chaotic White Shark Optimizer for the Unicost Set Covering Problem

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

Full description

Saved in:
Bibliographic Details
Main Authors: Pablo Zúñiga-Valenzuela, Broderick Crawford, Felipe Cisternas-Caneo, Eduardo Rodriguez-Tello, Ricardo Soto, José Barrera-Garcia, Fernando Lepe-Silva
Format: Article
Language:English
Published: MDPI AG 2025-07-01
Series:Mathematics
Subjects:
White Shark Optimizer
chaotic maps
metaheuristics
combinatorial optimization
binarization techniques
exploration–exploitation balance
Online Access:https://www.mdpi.com/2227-7390/13/13/2175
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2227-7390/13/13/2175

Similar Items