Multi-objective k-center sum clustering problem

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

Povzetek

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.

Ključne besede

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

Podatki

Jezik:	Angleški jezik
Leto izida:	2015
Tipologija:	1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija:	UNG - Univerza v Novi Gorici
UDK:	004
COBISS:	154428163
Št. ogledov:	30
Št. prenosov:	0
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

URN:	URN:SI:UNG
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	Str. 417-425
DOI:	https://doi.org/10.1007/978-3-319-13728-5_47
ID:	19159994