An evaluation of non-redundant objective sets based on the spatial similarity ratio

Multi-objective optimization is a challenging task in many disciplines. Although a number of algorithms have simplified this problem by degenerating redundant objectives into low-dimensional sets, there is currently no consensus method for evaluating their performance. In this paper, we propose an evaluation method that uses a spatial similarity ratio (SSR) to determine the quality of non-redundant objective sets (NRSs). We consider the reduction of all NRSs of three functions from 5D to 2D or 3D using our SSR-based method, and compare the results to those given by an inverted generational distance-based method. The results demonstrate that our method is more accurate, as it takes information from both the non-redundant and redundant objective sets into consideration. In addition, using the proposed SSR-based approach, no prior knowledge of the true Pareto set is required. Therefore, we can conclude that our SSR-based method is feasible for the assessment of non-redundant objective sets.

[1]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[2]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[3]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[4]  Eckart Zitzler,et al.  Are All Objectives Necessary? On Dimensionality Reduction in Evolutionary Multiobjective Optimization , 2006, PPSN.

[5]  Kalyanmoy Deb,et al.  Dimensionality reduction of objectives and constraints in multi-objective optimization problems: A system design perspective , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Eckart Zitzler,et al.  Objective Reduction in Evolutionary Multiobjective Optimization: Theory and Applications , 2009, Evolutionary Computation.

[7]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

[8]  R. Setiono,et al.  JMLR Workshop and Conference Proceedings Volume 10: Feature Selection in Data Mining Proceedings of the Fourth International Workshop on Feature Selection in Data Mining, June 21st, 2010, Hyderabad, India , 2010 .

[9]  Francesco di Pierro,et al.  Many-objective evolutionary algorithms and applications to water resources engineering , 2006 .

[10]  Eckart Zitzler,et al.  Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem , 2006, OR.

[11]  Carlos A. Coello Coello,et al.  Objective reduction using a feature selection technique , 2008, GECCO '08.

[12]  Kalyanmoy Deb,et al.  Non-linear Dimensionality Reduction Procedures for Certain Large-Dimensional Multi-objective Optimization Problems: Employing Correntropy and a Novel Maximum Variance Unfolding , 2007, EMO.

[13]  Ivor W. Tsang,et al.  Pareto Rank Learning in Multi-objective Evolutionary Algorithms , 2012, 2012 IEEE Congress on Evolutionary Computation.

[14]  Huan Liu,et al.  Feature Selection: An Ever Evolving Frontier in Data Mining , 2010, FSDM.

[15]  Kalyanmoy Deb.  Two Approaches for Single and Multi-Objective Dynamic Optimization , 2013, Metaheuristics for Dynamic Optimization.

[16]  Li Li,et al.  An improved multi-objective ant colony algorithm for building life cycle energy consumption optimisation , 2012, Int. J. Comput. Appl. Technol..