Visualization of the boundary solutions of high dimensional pareto front from a decision maker's perspective

Author(s):  
AKM Khaled Ahsan Talukder ◽  
Kalyanmoy Deb ◽  
Julian Blank
Author(s):  
Zhenkun Wang ◽  
Qingyan Li ◽  
Qite Yang ◽  
Hisao Ishibuchi

AbstractIt has been acknowledged that dominance-resistant solutions (DRSs) extensively exist in the feasible region of multi-objective optimization problems. Recent studies show that DRSs can cause serious performance degradation of many multi-objective evolutionary algorithms (MOEAs). Thereafter, various strategies (e.g., the $$\epsilon $$ ϵ -dominance and the modified objective calculation) to eliminate DRSs have been proposed. However, these strategies may in turn cause algorithm inefficiency in other aspects. We argue that these coping strategies prevent the algorithm from obtaining some boundary solutions of an extremely convex Pareto front (ECPF). That is, there is a dilemma between eliminating DRSs and preserving boundary solutions of the ECPF. To illustrate such a dilemma, we propose a new multi-objective optimization test problem with the ECPF as well as DRSs. Using this test problem, we investigate the performance of six representative MOEAs in terms of boundary solutions preservation and DRS elimination. The results reveal that it is quite challenging to distinguish between DRSs and boundary solutions of the ECPF.


2014 ◽  
Vol 22 (3) ◽  
pp. 479-501 ◽  
Author(s):  
Richard M. Everson ◽  
David J. Walker ◽  
Jonathan E. Fieldsend

Multi-objective optimisation yields an estimated Pareto front of mutually non- dominating solutions, but with more than three objectives, understanding the relationships between solutions is challenging. Natural solutions to use as landmarks are those lying near to the edges of the mutually non-dominating set. We propose four definitions of edge points for many-objective mutually non-dominating sets and examine the relations between them. The first defines edge points to be those that extend the range of the attainment surface. This is shown to be equivalent to finding points which are not dominated on projection onto subsets of the objectives. If the objectives are to be minimised, a further definition considers points which are not dominated under maximisation when projected onto objective subsets. A final definition looks for edges via alternative projections of the set. We examine the relations between these definitions and their efficacy in many dimensions for synthetic concave- and convex-shaped sets, and on solutions to a prototypical many-objective optimisation problem, showing how they can reveal information about the structure of the estimated Pareto front. We show that the “controlling dominance area of solutions” modification of the dominance relation can be effectively used to locate edges and interior points of high-dimensional mutually non-dominating sets.


Author(s):  
Mengyi Sun ◽  
Jianzhi Zhang

Abstract Organisms face tradeoffs in performing multiple tasks. Identifying the optimal phenotypes maximizing the organismal fitness (or Pareto front) and inferring the relevant tasks allow testing phenotypic adaptations and help delineate evolutionary constraints, tradeoffs, and critical fitness components, so are of broad interest. It has been proposed that Pareto fronts can be identified from high-dimensional phenotypic data, including molecular phenotypes such as gene expression levels, by fitting polytopes (lines, triangles, tetrahedrons, etc.), and a program named ParTI was recently introduced for this purpose. ParTI has identified Pareto fronts and inferred phenotypes best for individual tasks (or archetypes) from numerous datasets such as the beak morphologies of Darwin’s finches and mRNA concentrations in human tumors, implying evolutionary optimizations of the involved traits. Nevertheless, the reliabilities of these findings are unknown. Using real and simulated data that lack evolutionary optimization, we here report extremely high false positive rates of ParTI. The errors arise from phylogenetic relationships or population structures of the organisms analyzed and the flexibility of data analysis in ParTI that is equivalent to p-hacking. Because these problems are virtually universal, our findings cast doubt on almost all ParTI-based results and suggest that reliably identifying Pareto fronts and archetypes from high-dimensional phenotypic data is currently generally difficult.


2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Dan Qu ◽  
Xianfeng Ding ◽  
Hongmei Wang

In general, the proximities to a certain diversity along the front and the Pareto front have the equal importance for solving multiobjective optimization problems (MOPs). However, most of the existing evolutionary algorithms give priority to the proximity over the diversity. To improve the diversity and decrease execution time of the nondominated sorting genetic algorithm II (NSGA-II), an improved algorithm is presented in this paper, which adopts a new vector ranking scheme to decrease the whole runtime and utilize Part and Select Algorithm (PSA) to maintain the diversity. In this algorithm, a more efficient implementation of nondominated sorting, namely, dominance degree approach for nondominated sorting (DDA-NS), is presented. Moreover, an improved diversity preservation mechanism is proposed to select a well-diversified set out of an arbitrary given set. By embedding PSA and DDA-NS into NSGA-II, denoted as DNSGA2-PSA, the whole runtime of the algorithm is decreased significantly and the exploitation of diversity is enhanced. The computational experiments show that the combination of both (DDA-NS, PSA) to NSGA-II is better than the isolated use cases, and DNSGA2-PSA still performs well in the high-dimensional cases.


Sign in / Sign up

Export Citation Format

Share Document