𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu search-based algorithm for the fuzzy clustering problem

✍ Scribed by Khaled S Al-Sultan; Chawki A Fedjki

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
597 KB
Volume
30
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis

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 propose a new approach to this problem which is based on tabu search technique, and alms at finding a global solution of FCE We compare the performance of the algorithm with the fuzzy C-means algorithm.

πŸ“œ SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

A parallel tabu search algorithm for sol
A parallel tabu search algorithm for solving the container loading problem
✍ A Bortfeldt; H Gehring; D Mack πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 241 KB

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Iss