𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu-search-based heuristic for clustering

✍ Scribed by C.S. Sung; H.W. Jin

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
135 KB
Volume
33
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search-based algorithm for the fu
A tabu search-based algorithm for the fuzzy clustering problem
✍ Khaled S Al-Sultan; Chawki A Fedjki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 597 KB

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

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; SansοΏ½, Brunilde πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

A tabu search heuristic for the undirect
A tabu search heuristic for the undirected selective travelling salesman problem
✍ Michel Gendreau; Gilbert Laporte; FrΓ©dΓ©ric Semet πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 677 KB

The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G= ( V, E) with positive profits associated with vertices, and distances associated with edges. The STSP consists of determining a maximal profit Hamiltonian cycle over a subset of V whose length does not exceed a pres

A tabu search heuristic for periodic and
A tabu search heuristic for periodic and multi-depot vehicle routing problems
✍ Cordeau, Jean-FranοΏ½ois; Gendreau, Michel; Laporte, Gilbert πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 1 views

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t

Heuristic concentration and Tabu search:
Heuristic concentration and Tabu search: A head to head comparison
✍ K.E. Rosing; C.S. ReVelle; E. Rolland; D.A. Schilling; J.R. Current πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 471 KB

Earlier this year two papers applying the metaheuristics Tabu search (TS) and Heuristic concentration (HC) to the pmedian problem were published in consecutive volumes of this journal. Here we apply the method of HC to some of the data sets which were used for computational experience in the paper o