Hybrid Dynamic Resampling for Guided Evolutionary Multi-Objective Optimization

In Guided Evolutionary Multi-objective Optimization the goal is to find a diverse, but locally focused non-dominated front in a decision maker’s area of interest, as close as possible to the true Pareto-front. The optimization can focus its efforts towards the preferred area and achieve a better result [7, 9, 13, 17]. The modeled and simulated systems are often stochastic and a common method to handle the objective noise is Resampling. The given preference information allows to define better resampling strategies which further improve the optimization result. In this paper, resampling strategies are proposed that base the sampling allocation on multiple factors, and thereby combine multiple resampling strategies proposed by the authors in [15]. These factors are, for example, the Pareto-rank of a solution and its distance to the decision maker’s area of interest. The proposed hybrid Dynamic Resampling Strategy DR2 is evaluated on the Reference point-guided NSGA-II optimization algorithm (R-NSGA-II) [9].

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

[2]  Kalyanmoy Deb,et al.  Reference point-based evolutionary multi-objective optimization for industrial systems simulation , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[3]  Kalyanmoy Deb,et al.  Reference point based multi-objective optimization using evolutionary algorithms , 2006, GECCO.

[4]  Jürgen Branke,et al.  Sequential Sampling in Noisy Environments , 2004, PPSN.

[5]  Timothy W. Simpson,et al.  Visual Steering Commands for Trade Space Exploration: User-Guided Sampling With Example , 2009, J. Comput. Inf. Sci. Eng..

[6]  Thomas Bartz-Beielstein,et al.  Particle Swarm Optimization and Sequential Sampling in Noisy Environments , 2007, Metaheuristics.

[7]  Kalyanmoy Deb,et al.  A comparative study of dynamic resampling strategies for guided Evolutionary Multi-objective Optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

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

[9]  R. Lyndon While,et al.  Applying evolutionary algorithms to problems with noisy, time-consuming fitness functions , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

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

[11]  Loo Hay Lee,et al.  Efficient Simulation Budget Allocation for Selecting an Optimal Subset , 2008, INFORMS J. Comput..

[12]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[13]  Kalyanmoy Deb,et al.  Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls , 2012, 2012 IEEE Congress on Evolutionary Computation.

[14]  Kalyanmoy Deb,et al.  An Interactive Evolutionary Multiobjective Optimization Method Based on Progressively Approximated Value Functions , 2010, IEEE Transactions on Evolutionary Computation.

[15]  Kalyanmoy Deb,et al.  R-HV: A Metric for Computing Hyper-volume for Reference Point Based EMOs , 2014, SEMCCO.

[16]  Anthony Di Pietro.  Optimising evolutionary strategies for problems with varying noise strength , 2007 .

[17]  Jrgen Branke.  EFFICIENT SAMPLING IN INTERACTIVE MULTI-CRITERIA SELECTION , 2007 .