A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem
The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we...
Saved in:
| Main Author: | AlSultan, K.S. (author) |
|---|---|
| Other Authors: | Fedjki, C.A. (author), unknown (author) |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2564/1/a_tabu_search_based_algorithm_for_the_fu_al_sultan_isi_000073087700007.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A TABU SEARCH APPROACH TO THE CLUSTERING PROBLEM
by: AlSultan, K.S.
Published: (2020) -
Computational Experience On Four Algorithms For The Hard Clustering Problem
by: AlSultan, K.S.
Published: (2020) -
A Hard Clustering Approach To The Part Family Formation Problem
by: AlSultan, K.S.
Published: (2020) -
A Genetic Algorithm For The Part Family Formation Problem
by: AlSultan, K.S.
Published: (2020) -
Parallelizing Tabu Search on a Cluster of HeterogeneousWorkstations
by: Al-Yamani, Ahmad
Published: (2020)