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 problemPublished in RUNG: 05.06.2023; Views: 2290; Downloads: 0This document has many files! More...
