Multi-objective k-center sum clustering problem

Soumen Atta (Author), Priya Ranjan Sinha Mahapatra (Author)

Abstract

Given a set P of n objects in two dimensional plane and a positive integer k (≤ n), we have considered the problem of partitioning P into k clusters of circular shape so as to minimize the following two objectives: (i) the sum of radii of these k circular clusters and (ii) the number of points of P covered by more than one circular cluster. The NSGA-II based multi-objective genetic algorithm (MOGA) has been proposed to solve this problem.

Keywords

k-center sum problem;clustering problem;multi-objective optimization;NSGA-II;facility location problem;

Data

Language:	English
Year of publishing:	2015
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	UNG - University of Nova Gorica
UDC:	004
COBISS:	154428163
Views:	30
Downloads:	0
Average score:	0 (0 votes)
Metadata:

Other data

URN:	URN:SI:UNG
Type (COBISS):	Not categorized
Pages:	Str. 417-425
DOI:	https://doi.org/10.1007/978-3-319-13728-5_47
ID:	19159994