A Tabu Search Approach to Clustering

Marcel Turkensteen and Kim A. Andersen
Additional contact information
Marcel Turkensteen: CORAL - Center of OR Applications in Logistics, Aarhus School of Business
Kim A. Andersen: CORAL - Center of OR Applications in Logistics, Aarhus School of Business

Chapter 77 in Operations Research Proceedings 2008, 2009, pp 475-480 from Springer

Abstract: Summary In Clustering Problems, groups of similar subjects are to be retrieved from large data sets. Meta-heuristics are often used to obtain high quality solutions within reasonable time limits. Tabu search has proved to be a successful methodology for solving optimization problems, but applications to clustering problems are rare. In this paper, we construct a tabu search approach and compare it to the existing k-means and simulated annealing approaches. We find that tabu search returns solutions of very high quality for various types of cluster instances

Keywords: Tabu Search; Cluster Problem; Tabu List; Tabu Search Algorithm; High Quality Solution (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_77

Ordering information: This item can be ordered from
http://www.springer.com/9783642001420

DOI: 10.1007/978-3-642-00142-0_77

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().