A hybrid Sand Cat Swarm Optimization algorithm incorporating local search achieves superior solutions in 96 percent of test instances for the Generalized Vertex Cover Problem while cutting average computation runtime by more than 68 percent compared to state-of-the-art algorithms. The newly developed computational approach, designated as GVC-LSSCSO, addresses the Generalized Vertex Cover Problem, a challenging mathematical formulation with significant engineering applications.
To establish a strong foundation for the optimization process, the researchers designed a specialized initialization rule that generates a high-quality population.
To expand the search range across the solution space, the authors introduced the Weibull flight strategy. To enhance solution quality during subsequent phases, the framework applies a local search method that combines tabu search with the gain function. In addition, a vertex perturbation mechanism is adopted to prevent the optimization trajectory from becoming trapped in local optima.
The performance of GVC-LSSCSO was evaluated experimentally on 48 random graphs featuring up to 1,000 vertices and 450,000 edges. Experimental results demonstrate that GVC-LSSCSO achieves better solutions in 96 percent of these benchmark instances compared to state-of-the-art algorithms. Alongside these improvements in solution accuracy, the hybrid algorithm also demonstrates substantial computational efficiency, reducing the average runtime by over 68 percent relative to existing state-of-the-art methods.
Subject of Research: Optimization algorithms for the generalized vertex cover problem
Article Title: Generalized vertex cover problem based on the local search algorithm and the sand cat swarm optimization algorithm
Article References: Chen, J., Li, X., & Li, Y. (2027). Generalized vertex cover problem based on the local search algorithm and the sand cat swarm optimization algorithm. Cluster Computing, 30(1), Article 43. https://doi.org/10.1007/s10586-026-06821-3
Image Credits: AI Generated
DOI: 10.1007/s10586-026-06821-3
Keywords: generalized vertex cover problem, sand cat swarm optimization, local search algorithm, GVC-LSSCSO, Weibull flight strategy, tabu search, gain function, vertex perturbation, random graphs, combinatorial optimization, population initialization, edge weights, vertex weights, runtime reduction, local optima avoidance, graph algorithms
News Source: William Thompson. (November 21, 2026). Hybrid Sand Cat Algorithm Cuts Vertex Cover Runtime by 68 Percent. Scienmag.



