Multiple single objective Pareto sampling
暂无分享,去创建一个
We detail a new nonPareto evolutionary multiobjective algorithm, multiple single objective Pareto sampling (MSOPS), that performs a parallel search of multiple conventional target vector based optimisations, e.g. weighted min-max. The method can be used to generate the Pareto set and analyse problems with large numbers of objectives. The method allows bounds and discontinuities of the Pareto set to be identified and the shape of the surface to be analysed, despite not being able to visualise the surface easily. A new combination metric is also introduced that allows the shape of the objective surface that gives rise to discontinuities in the Pareto surface to be analysed easily.
[1] Rainer Storn,et al. Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..
[2] R. Storn,et al. Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .
[3] Bernhard Sendhoff,et al. Adapting Weighted Aggregation for Multiobjective Evolution Strategies , 2001, EMO.
[4] Jürgen Teich,et al. Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques , 2003, EMO.