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.
CITATION STYLE
Atta, S., & Mahapatra, P. R. S. (2015). Multi-objective k-center sum clustering problem. In Advances in Intelligent Systems and Computing (Vol. 337, pp. 417–425). Springer Verlag. https://doi.org/10.1007/978-3-319-13728-5_47
Mendeley helps you to discover research relevant for your work.