NDLI: Heuristic Methods for Large Centroid Clustering Problems

Content Provider	Springer Nature Link
Author	Taillard, Éric D.
Copyright Year	2003
Abstract	This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and the centres is minimized. The first method proposed is a candidate list search that produces good solutions in a short amount of time if the number of centres in the problem is not too large. The second method is a general local optimization approach that finds very good solutions. The third method is designed for problems with a large number of centres; it decomposes the problem into subproblems that are solved independently. Numerical results show that these methods are efficient—dozens of best solutions known to problem instances of the literature have been improved—and fast, handling problem instances with more than 85,000 entities and 15,000 centres—much larger than those solved in the literature. The expected complexity of these new procedures is discussed and shown to be comparable to that of an existing method which is known to be very fast.
Starting Page	51
Ending Page	73
Page Count	23
File Format	PDF
ISSN	13811231
Journal	Journal of Heuristics
Volume Number	9
Issue Number	1
e-ISSN	15729397
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2003-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Artificial Intelligence (incl. Robotics) Calculus of Variations and Optimal Control Optimization Operations Research, Mathematical Programming Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Artificial Intelligence Management Science and Operations Research Computer Networks and Communications Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Heuristic for Boolean Optimization Problems

Heuristic Solution of Open Bin Packing Problems

Heuristics for Large Constrained Vehicle Routing Problems

A Seeded Memetic Algorithm for Large Unit Commitment Problems

A Range-Compaction Heuristic for Graph Coloring

Heuristic Techniques for Single Line Train Scheduling

An Heuristic Algorithm for Handling Multiple Responses

A Heuristic Approach for Antenna Positioning in Cellular Networks

Self-Adaptive Genetic Algorithm for Clustering

Heuristic Methods for Large Centroid Clustering Problems

Similar Documents

A Heuristic for Boolean Optimization Problems

Heuristic Solution of Open Bin Packing Problems

Heuristics for Large Constrained Vehicle Routing Problems

A Seeded Memetic Algorithm for Large Unit Commitment Problems

A Range-Compaction Heuristic for Graph Coloring

Heuristic Techniques for Single Line Train Scheduling

An Heuristic Algorithm for Handling Multiple Responses

A Heuristic Approach for Antenna Positioning in Cellular Networks

Self-Adaptive Genetic Algorithm for Clustering

Heuristic Methods for Large Centroid Clustering Problems