Clustering Analysis for the Pareto Optimal Front in Multi-Objective Optimization

Computation

卷:10

Carlos Enrique Montenegro¹  Lilian Astrid Bejarano¹  Helbert Eduardo Espitia¹ 

[1] Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia;

关键词: clustering;    c-means;    fuzzy;    Pareto front;    multi-objective;    optimization;   

DOI  :  10.3390/computation10030037

来源: DOAJ

【 摘 要 】

Bio-inspired algorithms are a suitable alternative for solving multi-objective optimization problems. Among different proposals, a widely used approach is based on the Pareto front. In this document, a proposal is made for the analysis of the optimal front for multi-objective optimization problems using clustering techniques. With this approach, an alternative is sought for further use and improvement of multi-objective optimization algorithms considering solutions and clusters found. To carry out the clustering, the methods k-means and fuzzy c-means are employed, in such a way that there are two alternatives to generate the possible clusters. Regarding the results, it is observed that both clustering algorithms perform an adequate separation of the optimal Pareto continuous fronts; for discontinuous fronts, k-means and fuzzy c-means obtain results that complement each other (there is no superior algorithm). In terms of processing time, k-means presents less execution time than fuzzy c-means.

【 授权许可】

Unknown