Clustering in a 2d Pareto Front: p-median and p-center are solvable in polynomial time

06/06/2018
by   Nicolas Dupin, et al.
0

This paper is motivated by a real life application of multi-objective optimization without preference. Having many non-dominated solutions with Pareto dominance, the problem is to select and present a small number of representative solutions to decision makers. The p-median and p-center clustering problems are investigated in this paper for the 2-dimensional case assuming that the points to cluster are not comparable in R^2. This paper proves that these clustering problems can be solved to optimality with a unified dynamic programming algorithm. Having N points to partition in K clusters, a polynomial complexity is proven in O(N^3) for the p-median problem, in O(N^2.(K + N)) for the discrete p-center problem and in O(K.N^2) for the continuous p-center problem. The dynamic programming algorithm can be adapted to consider cardinality constraints for the clusters, which can improve the complexities. These algorithms allows furthermore a natural parallel implementation. A posteriori, the complexity of the clustering algorithms allows also to consider these algorithms inside multi-objective meta-heuristics to archive diversified non-dominated points along the Pareto front.

READ FULL TEXT
research
06/06/2018

Clustering in a 2-dimensional Pareto Front: the p-median and p-center problems are polynomially solvable

This paper is motivated by a real life application of multi-objective op...
research
08/19/2019

Planar p-center problems are solvable in polynomial time when clustering a Pareto Front

This paper is motivated by real-life applications of bi-objective optimi...
research
02/26/2020

Polynomial algorithms for p-dispersion problems in a 2d Pareto Front

Having many best compromise solutions for bi-objective optimization prob...
research
02/23/2018

A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks

Wireless Multihop Networks (WMHNs) have to strike a trade-off among dive...
research
01/23/2021

Unsupervised clustering of series using dynamic programming

We are interested in clustering parts of a given single multi-variate se...
research
09/17/2020

Multi-objective dynamic programming with limited precision

This paper addresses the problem of approximating the set of all solutio...
research
12/31/2020

Faster Distance-Based Representative Skyline and k-Center Along Pareto Front in the Plane

We consider the problem of computing the distance-based representative s...

Please sign up or login with your details

Forgot password? Click here to reset