OCD: Online Convergence Detection for Evolutionary Multi-Objective Algorithms Based on Statistical Testing

Over the last decades, evolutionary algorithms (EA) have proven their applicability to hard and complex industrial optimization problems in many cases. However, especially in cases with high computational demands for fitness evaluations (FE), the number of required FE is often seen as a drawback of these techniques. This is partly due to lacking robust and reliable methods to determine convergence, which would stop the algorithm before useless evaluations are carried out. To overcome this drawback, we define a method for online convergence detection (OCD) based on statistical tests, which invokes a number of performance indicators and which can be applied on a stand-alone basis (no predefined Pareto fronts, ideal and reference points). Our experiments show the general applicability of OCD by analyzing its performance for different algorithmic setups and on different classes of test functions. Furthermore, we show that the number of FE can be reduced considerably --- compared to common suggestions from literature --- without significantly deteriorating approximation accuracy.

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

[2]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[3]  S. Dudoit,et al.  Multiple Testing Procedures with Applications to Genomics , 2007 .

[4]  Nicola Beume,et al.  S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure Problem , 2009, Evolutionary Computation.

[5]  Kalyanmoy Deb,et al.  A Hybrid Evolutionary Multi-objective and SQP Based Procedure for Constrained Optimization , 2007, ISICA.

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

[7]  Jing J. Liang,et al.  Problem Definitions for Performance Assessment of Multi-objective Optimization Algorithms , 2007 .

[8]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[9]  Sanyou Zeng,et al.  Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings , 2007, ISICA.

[10]  Marco Laumanns,et al.  PISA: A Platform and Programming Language Independent Interface for Search Algorithms , 2003, EMO.

[11]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

[12]  James H. Stapleton,et al.  Linear Statistical Models , 1995 .

[13]  Kalyanmoy Deb,et al.  Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions , 2003, EMO.

[14]  Peter J. Fleming,et al.  Multiobjective genetic algorithms made easy: selection sharing and mating restriction , 1995 .

[15]  Ross Ihaka,et al.  Gentleman R: R: A language for data analysis and graphics , 1996 .

[16]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

[17]  Lothar Thiele,et al.  SPAM: Set Preference Algorithm for Multiobjective Optimization , 2008, PPSN.

[18]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[20]  Nicola Beume,et al.  Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization , 2007, EMO.

[21]  Joshua D. Knowles,et al.  ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems , 2006, IEEE Transactions on Evolutionary Computation.

[22]  Simon M. Lucas,et al.  Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings , 2008, PPSN.

[23]  Nicola Beume,et al.  SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..

[24]  Heike Trautmann,et al.  A Convergence Criterion for Multiobjective Evolutionary Algorithms Based on Systematic Statistical Testing , 2008, PPSN.

[25]  Mikkel T. Jensen,et al.  Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms , 2003, IEEE Trans. Evol. Comput..

[26]  Nicola Beume,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Gradient-based / Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric , 2007 .

[27]  Marc Schoenauer,et al.  A Steady Performance Stopping Criterion for Pareto-based Evolutionary Algorithms , 2004 .

[28]  David J. Sheskin,et al.  Handbook of Parametric and Nonparametric Statistical Procedures , 1997 .

[29]  Eckart Zitzler,et al.  Indicator-Based Selection in Multiobjective Search , 2004, PPSN.

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

[31]  Michael T. M. Emmerich,et al.  Single- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels , 2006, IEEE Transactions on Evolutionary Computation.

[32]  Günter Rudolph,et al.  Capabilities of EMOA to Detect and Preserve Equivalent Pareto Subsets , 2007, EMO.

[33]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

[34]  Kalyanmoy Deb,et al.  A hybrid multi-objective optimization procedure using PCX based NSGA-II and sequential quadratic programming , 2007, 2007 IEEE Congress on Evolutionary Computation.

[35]  Wolfgang Ponweiser,et al.  Multiobjective Optimization on a Limited Budget of Evaluations Using Model-Assisted -Metric Selection , 2008, PPSN.

[36]  Tobias Wagner,et al.  On the design of optimisers for surface reconstruction , 2007, GECCO '07.