Improved Sampling of Decision Space for Pareto Estimation

Pareto Estimation (PE) is a novel method for increasing the density of Pareto optimal solutions across the entire Pareto Front or in a specific region of interest. PE identifies the inverse mapping of Pareto optimal solutions, namely, from objective space to decision space. This identification can be performed using a number of modeling techniques, how- ever, for the sake of simplicity in this work we use a radial basis neural network. In any modeling method, the quality of the resulting model depends heavily on the training samples used. The original version of PE uses the result- ing set of Pareto optimal solutions from any multi-objective optimization algorithm and then utilizes this set to identify the aforementioned mapping. However, we argue that this selection may not always be the best possible and propose an alternative scheme to improve the resulting set of Pareto optimal solutions in order to produce higher quality samples for the identification scheme in PE. The proposed approach is integrated with MAEA-gD, and the resulting solutions are used with PE. The results show that the proposed method shows promise, in that there is measurable improvement in the quality of the estimated PE in terms of the coverage and density.

[1]  Alex B. McBratney,et al.  The design of optimal sampling schemes for local estimation and mapping of of regionalized variables—I: Theory and method , 1981 .

[2]  P. Fleming,et al.  Increasing the Density of Multi-Objective Multi-Modal Solutions using Clustering and Pareto Estimation Techniques , 2013 .

[3]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[4]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[5]  Peter J. Fleming,et al.  Increasing the density of available pareto optimal solutions , 2012 .

[6]  Peter J. Fleming,et al.  Towards Understanding the Cost of Adaptation in Decomposition-Based Optimization Algorithms , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[7]  A. J. Jerri The Shannon sampling theorem—Its various extensions and applications: A tutorial review , 1977, Proceedings of the IEEE.

[8]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[9]  Bernhard Sendhoff,et al.  Adapting Weighted Aggregation for Multiobjective Evolution Strategies , 2001, EMO.

[10]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[11]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[12]  Evan J. Hughes,et al.  Many-objective directed evolutionary line search , 2011, GECCO '11.

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

[14]  Evan J. Hughes,et al.  Radar Waveform Optimisation as a Many-Objective Application Benchmark , 2007, EMO.

[15]  Minghe Sun,et al.  Interactive multiple objective programming using Tchebycheff programs and artificial neural networks , 2000, Comput. Oper. Res..

[16]  E. Hughes Multiple single objective Pareto sampling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[18]  Peter J. Fleming,et al.  Generalized decomposition and cross entropy methods for many-objective optimization , 2014, Inf. Sci..

[19]  Peter J. Fleming,et al.  Pareto Front Estimation for Decision Making , 2014, Evolutionary Computation.

[20]  Zhuhong Zhang,et al.  Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse control , 2008, Appl. Soft Comput..

[21]  Andrzej Jaszkiewicz,et al.  Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem , 2003, IEEE Trans. Evol. Comput..

[22]  K. Miettinen,et al.  Incorporating preference information in interactive reference point methods for multiobjective optimization , 2009 .

[23]  Bernhard Sendhoff,et al.  A Multiobjective Evolutionary Algorithm Using Gaussian Process-Based Inverse Modeling , 2015, IEEE Transactions on Evolutionary Computation.

[24]  Andy D. Pimentel,et al.  Multiobjective optimization and evolutionary algorithms for the application mapping problem in multiprocessor system-on-chip design , 2006, IEEE Transactions on Evolutionary Computation.

[25]  Peter J. Fleming,et al.  Generalized Decomposition , 2013, EMO.