The Improvement Direction Mapping Method

The Improvement Direction Mapping (IDM) is a novel multi-objective local-search method, that independently steers a solution set towards promising regions by computing improvement directions in the objective space and transform them, into the variable space, as search directions. The IDM algorithm consists of two main sub-tasks 1) the computation of the improvement directions in the objective space 2) the transformation of directions from the objective space to the variable space. The transformation from the objective to the variable space is carried out via a pseudo-inverse of the Jacobian matrix. The goal of this paper is two fold: it introduces the main IDM algorithm and three approaches to determine improvement directions, and then it explores the trade-off of either approach by performing statistical analysis on the experimental results. The approaches are based on: 1) Pareto dominance, 2) aggregation functions, and 3) indicator functions. A set of well-known benchmark problems are used to compare the three proposed improvement directions and the Directed Search method. This paper is devoted to introduce the IDM algorithm for multi-objective optimization, nonetheless, the application of IDM for hybridizing stochastic-global-search algorithms is straight forward.

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

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

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

[4]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[5]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[6]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

[7]  Benjamín Barán,et al.  Performance metrics in multi-objective optimization , 2015, 2015 Latin American Computing Conference (CLEI).

[8]  A. Messac,et al.  The normalized normal constraint method for generating the Pareto frontier , 2003 .

[9]  M. Longnecker,et al.  A modified Wilcoxon rank sum test for paired data , 1983 .

[10]  Carlos Segura,et al.  Gradient subspace approximation: a direct search method for memetic computing , 2017, Soft Comput..

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

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

[13]  Lothar Thiele,et al.  Quality Assessment of Pareto Set Approximations , 2008, Multiobjective Optimization.

[14]  Junichi Suzuki,et al.  R2-IBEA: R2 indicator based evolutionary algorithm for multiobjective optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

[15]  Carlos A. Coello Coello,et al.  The directed search method for multi-objective memetic algorithms , 2015, Computational Optimization and Applications.

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

[17]  Arturo Hernández Aguirre,et al.  Computation of the improvement directions of the Pareto front and its application to MOEAs , 2020, GECCO.

[18]  Hisao Ishibuchi,et al.  Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.

[19]  Hisao Ishibuchi,et al.  Pareto Fronts of Many-Objective Degenerate Test Problems , 2016, IEEE Transactions on Evolutionary Computation.

[20]  Jinhua Zheng,et al.  Spread Assessment for Evolutionary Multi-Objective Optimization , 2009, EMO.

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

[22]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

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

[24]  Bernhard Sendhoff,et al.  A critical survey of performance indices for multi-objective optimisation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..