Skip to content

K-GA-PSO++: a novel hybrid algorithm for clustering problems

Oct 2026 · Cluster Computing · Vol 29 · 0 citations · 23 references

TL;DR

K-GA-PSO++, a clustering-oriented hybrid framework integrating K-means++, a genetic algorithm (GA), and particle swarm optimization (PSO), achieves a lower cross-dataset mean runtime than the four metaheuristic baselines, demonstrating a favorable balance between geometric clustering quality and computational cost.

View source

Similar papers

Open access Oct 2026

A HYBRID CIAM-GA ALGORITHM BASED ON CLUSTER INITIALIZATION AND ADAPTIVE MEMETIC SEARCH FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

The paper addresses the Capacitated Vehicle Routing Problem (CVRP). Using the giant-tour solution representation with greedy route decoding, threegenetic-algorithm (GA) enhancement mechanisms are implemented and systematically compared via ablation: k -means-based cluster-first populationinitialization, memetic refinem...

O. Sira, Oleh Tonitsa · 0 citations
Open access Oct 2026

A comparative study of standard PSO and adaptive fuzzy PSO for optimization

In engineering, complex optimization problems often require efficient and reliable solution methods. An example of a metaheuristic algorithm is particle swarm optimization (PSO), which is widely used for its simplicity and adaptability. However, PSO performance is highly sensitive to parameter settings. To tackle this...

P. O. Adebayo, W. Yahya, R. Jimoh · 0 citations
Open access Oct 2026

A Systematic Experimental Comparison of Exact, Greedy, Local Search, Metaheuristic, and Distributed Algorithms for the Minimum Dominating Set Problem

The Minimum Dominating Set (MDS) problem is an NP-hard optimization problem that aims to find the smallest dominating set of nodes encompassing all nodes of a graph. Because it is equivalent to the cluster covering problem, approximate solutions better than the multiplier (1−ε)lnn cannot be obtained in polynomial time...

Furkan Oztemiz, Selman Yakut · 0 citations
Open access Sep 2026

Artificial Bee Colony Algorithm with UCB-Guided Multi-Strategy Coordination

Results indicate favorable overall performance across standard benchmark functions, the CEC2014 test suite, and the investigated engineering design problem, where UMABC achieves the lowest Mean, Std, and Worst objective values among the six compared algorithms.

Yang Cao, Hong-Wei Hu, Yun-Peng Jia · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.