Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization

The Hausdorff distance dH is a widely used tool to measure the distance between different objects in several research fields. Possible reasons for this might be that it is a natural extension of the well-known and intuitive distance between points and/or the fact that dH defines in certain cases a metric in the mathematical sense. In evolutionary multiobjective optimization (EMO) the task is typically to compute the entire solution set-the so-called Pareto set-respectively its image, the Pareto front. Hence, dH should, at least at first sight, be a natural choice to measure the performance of the outcome set in particular since it is related to the terms spread and convergence as used in EMO literature. However, so far, dH does not find the general approval in the EMO community. The main reason for this is that dH penalizes single outliers of the candidate set which does not comply with the use of stochastic search algorithms such as evolutionary strategies. In this paper, we define a new performance indicator, Δp, which can be viewed as an “averaged Hausdorff distance” between the outcome set and the Pareto front and which is composed of (slight modifications of) the well-known indicators generational distance (GD) and inverted generational distance (IGD). We will discuss theoretical properties of Δp (as well as for GD and IGD) such as the metric properties and the compliance with state-of-theart multiobjective evolutionary algorithms (MOEAs), and will further on demonstrate by empirical results the potential of Δp as a new performance indicator for the evaluation of MOEAs.

[1]  Thomas Hanne,et al.  Global Multiobjective Optimization with Evolutionary Algorithms: Selection Mechanisms and Mutation Control , 2001, EMO.

[2]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[3]  Bernhard Sendhoff,et al.  On Test Functions for Evolutionary Multi-objective Optimization , 2004, PPSN.

[4]  A. Farhang-Mehr,et al.  Diversity assessment of Pareto optimal solution sets: an entropy approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[5]  M. Hansen,et al.  Evaluating the quality of approximations to the non-dominated set , 1998 .

[6]  Kathrin Padberg,et al.  Numerical analysis of transport in dynamical systems , 2005 .

[7]  Marco Laumanns,et al.  Convergence of stochastic search algorithms to finite size pareto set approximations , 2008, J. Glob. Optim..

[8]  Carlos A. Coello Coello,et al.  Solving Multiobjective Optimization Problems Using an Artificial Immune System , 2005, Genetic Programming and Evolvable Machines.

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

[10]  C. A. Coello Coello,et al.  Hybridizing evolutionary strategies with continuation methods for solving multi-objective problems , 2008 .

[11]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[12]  Isao Ono,et al.  Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA , 2007, GECCO '07.

[13]  Marco Laumanns,et al.  Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms , 2010, Evolutionary Computation.

[14]  P. Loridan ε-solutions in vector minimization problems , 1984 .

[15]  Carlos A. Coello Coello,et al.  HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

[16]  Carlos A. Coello Coello,et al.  Evolutionary multiobjective optimization , 2011, WIREs Data Mining Knowl. Discov..

[17]  Miao Li,et al.  Study of population diversity of multiobjective evolutionary algorithm based on immune and entropy principles , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[18]  S. Schäffler,et al.  Stochastic Method for the Solution of Unconstrained Vector Optimization Problems , 2002 .

[19]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[20]  Kalyanmoy Deb,et al.  Evaluating the -Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions , 2005, Evolutionary Computation.

[21]  A. Farhang-Mehr,et al.  Entropy-based multi-objective genetic algorithm for design optimization , 2002 .

[22]  Oliver Schütze,et al.  On the interplay of generator and archiver within archive based multiobjective evolutionary algorithms , 2010, 2010 7th International Conference on Electrical Engineering Computing Science and Automatic Control.

[23]  David W. Corne,et al.  Properties of an adaptive archiving algorithm for storing nondominated vectors , 2003, IEEE Trans. Evol. Comput..

[24]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[25]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[26]  Jürgen Teich,et al.  Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques , 2003, EMO.

[27]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[28]  Kenneth Falconer,et al.  Fractal Geometry: Mathematical Foundations and Applications , 1990 .

[29]  Stefan Siegmund,et al.  APPROXIMATION OF ATTRACTORS OF NONAUTONOMOUS DYNAMICAL SYSTEMS , 2005 .

[30]  Serpil Sayin,et al.  Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming , 2000, Math. Program..

[31]  M. Dellnitz,et al.  Covering Pareto Sets by Multilevel Subdivision Techniques , 2005 .

[32]  Yves Lechevallier,et al.  Adaptive Hausdorff distances and dynamic clustering of symbolic interval data , 2006, Pattern Recognit. Lett..

[33]  Johannes Bader,et al.  Hypervolume-based search for multiobjective optimization: Theory and methods , 2010 .

[34]  M. Dellnitz,et al.  A subdivision algorithm for the computation of unstable manifolds and global attractors , 1997 .

[35]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[36]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[37]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[38]  Carlos A. Coello Coello,et al.  Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer , 2004, GECCO.

[39]  Ashutosh Tiwari,et al.  Finding exact solutions for multi-objective optimisation problems using a symbolic algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[40]  Jörg Fliege,et al.  Steepest descent methods for multicriteria optimization , 2000, Math. Methods Oper. Res..

[41]  Liu Liu,et al.  A Novel Epsilon-Dominance Multi-objective Evolutionary Algorithms for Solving DRS Multi-objective Optimization Problems    , 2007, Third International Conference on Natural Computation (ICNC 2007).

[42]  Carlos A. Coello Coello,et al.  Some comments on GD and IGD and relations to the Hausdorff distance , 2010, GECCO '10.

[43]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[44]  Octavia I. Camps,et al.  Line-Based Recognition Using A Multidimensional Hausdorff Distance , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[45]  Jason R. Schott Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[46]  Oliver Schütze,et al.  On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems , 2005, Practical Approaches to Multi-Objective Optimization.

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

[48]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[49]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: some current research trends and topics that remain to be explored , 2009, Frontiers of Computer Science in China.

[50]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[51]  Olivier Teytaud,et al.  On the Hardness of Offline Multi-objective Optimization , 2007, Evolutionary Computation.

[52]  Günter Rudolph,et al.  Evolutionary Optimization of Dynamic Multiobjective Functions , 2006 .