Investigation of Archiving Techniques for Evolutionary Multi-objective Optimizers

Abstract:  The optimization of multi-objective problems from the Pareto dominance viewpoint can lead to huge sets of incomparable solutions. Many heuristic techniques proposed to these problems have to deal with approximation sets that can be limited or not. Usually, a new solution generated by a heuristic is compared with other archived non-dominated solutions generated previously. Many techniques deal with limited size archives, since comparisons within unlimited archives may require significant computational effort. To maintain limited archives, solutions need to be discarded. Several techniques were proposed to deal with the problem of deciding which solutions remain in the archive and which are discarded. Previous investigations showed that those techniques might not prevent deterioration of the archives. In this study, we propose to store discarded solutions in a secondary archive and, periodically, recycle them, bringing them back to the optimization process. Three recycling techniques were investigated for three known methods. The datasets for the experiments consisted of 91 instances of discrete and continuous problems with 2, 3 and 4 objectives. The results showed that the recycling method can benefit the tested optimizers on many problem classes.

[1]  R. Lyndon While,et al.  A Scalable Multi-objective Test Problem Toolkit , 2005, EMO.

[2]  Marco César Goldbarg,et al.  Analyzing Limited Size Archivers of Multi-objective Optimizers , 2014, 2014 Brazilian Conference on Intelligent Systems.

[3]  Tobias Friedrich,et al.  Don't be greedy when calculating hypervolume contributions , 2009, FOGA '09.

[4]  Marco Laumanns,et al.  On Sequential Online Archiving of Objective Vectors , 2011, EMO.

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

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

[7]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[8]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[9]  Joshua D. Knowles.  Local-search and hybrid evolutionary algorithms for Pareto optimization , 2002 .

[10]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

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

[12]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

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

[14]  Thomas Hanne,et al.  On the convergence of multiobjective evolutionary algorithms , 1999, Eur. J. Oper. Res..

[15]  Marco Laumanns,et al.  Stochastic convergence of random search methods to fixed size Pareto front approximations , 2011, Eur. J. Oper. Res..

[16]  Huidong Jin,et al.  Adaptive, convergent, and diversified archiving strategy for multiobjective evolutionary algorithms , 2010, Expert Syst. Appl..

[17]  Marco Laumanns,et al.  On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms , 2001 .

[18]  Mario Köppen,et al.  Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems , 2007, EMO.

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

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

[21]  David W. Corne,et al.  Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem , 2003, EMO.

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

[23]  Aurora Trinidad Ramirez Pozo,et al.  Using archiving methods to control convergence and diversity for Many-Objective Problems in Particle Swarm Optimization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[24]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

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

[26]  David Corne,et al.  Bounded Pareto Archiving: Theory and Practice , 2004, Metaheuristics for Multiobjective Optimisation.

[27]  W. Kruskal,et al.  Use of Ranks in One-Criterion Variance Analysis , 1952 .

[28]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..