Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Multi-objective k-Center Sum Clustering Problem
verfasst von : Soumen Atta, Priya Ranjan Sinha Mahapatra
Erschienen in: Emerging ICT for Bridging the Future - Proceedings of the 49th Annual Convention of the Computer Society of India (CSI) Volume 1
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.