MSOPS-II: A general-purpose Many-Objective optimiser

Existing evolutionary methods capable of true many-objective optimisation have been limited in their application: for example either initial search directions need to be specified a-priori, or the use of hypervolume limits the search in practice to less than 10 objective dimensions. This paper describes two extensions to the multiple single objective pareto sampling (MSOPS) algorithm. The first provides automatic target vector generation, removing the requirement for initial a-priori designer intervention; and secondly redefines the fitness assignment method to simplify analysis and allow more comprehensive constraint handling. The significant enhancements allow the new MSOPS-II ranking process to be used as part of a general-purpose multi/many objective optimisation algorithm, requiring minimal initial configuration.

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

[2]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[3]  Evan J. Hughes,et al.  Evolutionary many-objective optimisation: many once or one many? , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  Nicola Beume,et al.  Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization , 2007, EMO.

[5]  Peter J. Fleming,et al.  Evolutionary many-objective optimisation: an exploratory analysis , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[6]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

[7]  Evan J. Hughes.  Multi-Objective Equivalent Random Search , 2006, PPSN.

[8]  Masahiro Tanaka,et al.  GA-based decision support system for multicriteria optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.