Combinatorial clustering algorithm of quantum-behaved particle swarm optimization and cloud model
Summary: We propose a combinatorial clustering algorithm of cloud model and quantum-behaved particle swarm optimization (COCQPSO) to solve the stochastic problem. The algorithm employs a novel probability model as well as a permutation-based local search method. We are setting the parameters of COCQPSO based on the design of experiment. In the comprehensive computational study, we scrutinize the performance of COCQPSO on a set of widely used benchmark instances. By benchmarking combinatorial clustering algorithm with state-of-the-art algorithms, we can show that its performance compares very favorably. The fuzzy combinatorial optimization algorithm of cloud model and quantum-behaved particle swarm optimization (FCOCQPSO) in vague sets (IVSs) is more expressive than the other fuzzy sets. Finally, numerical examples show the clustering effectiveness of COCQPSO and FCOCQPSO clustering algorithms which are extremely remarkable.
- Combinatorial particle swarm optimization (CPSO) for partitional clustering problem
- Optimization of fuzzy clustering criteria by a hybrid PSO and fuzzy c-means clustering algorithm
- An improved binary quantum-behaved particle swarm optimization clustering algorithm
- A New Composite Algorithm for Clustering Problems
- A two-step hybrid PSO-based clustering algorithm
This page was built for publication: Combinatorial clustering algorithm of quantum-behaved particle swarm optimization and cloud model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459897)
