Oriented multi-mutation strategy in a many-objective evolutionary algorithm

Abstract Reference-point-based many objective optimisation is recognised to be a promising method with various applications. To mitigate the loss of selection pressure, most existing works try to discover a new preference relation and promote active diversity in its decisive space. However, with regard to breeding their off-springs, maintaining a good balance between convergence and diversity remains a dilemma. This paper suggests a novel θ dominance-based evolutionary algorithm (abbreviated as NUM-θ-DEA), which uses non-uniform mutation (NUM) instead of polynomial mutation. Its hybrid variant with a dual-stage model is also proposed. The technique focuses on rational exploitation and makes comprehensive use of the merits of non-uniform mutation, simulating binary crossover and differential evolution strategy. An extensive comparison with other many-objective optimisers was conducted in all the test benchmark problems with 3, 5, 8, 10, or 15 objectives. Experimental results and their relevant analyses illustrate that a very encouraging target can be achieved by NUM-θ-DEA with a multi-strategy switching mechanism.

[1]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[3]  R. Lyndon While,et al.  A Scalable Multi-objective Test Problem Toolkit , 2005, EMO.

[4]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[5]  Kalyanmoy Deb,et al.  Analysing mutation schemes for real-parameter genetic algorithms , 2014, Int. J. Artif. Intell. Soft Comput..

[6]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[7]  Maria João Alves,et al.  MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem , 2007, Comput. Oper. Res..

[8]  Kim-Fung Man,et al.  A Jumping Gene Paradigm for Evolutionary Multiobjective Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[9]  Bernabé Dorronsoro,et al.  A Study of the Combination of Variation Operators in the NSGA-II Algorithm , 2013, CAEPIA.

[10]  A. Solow,et al.  On the measurement of biological diversity , 1993 .

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

[12]  Liang-Hong Wu,et al.  A novel harmony search algorithm with gaussian mutation for multi-objective optimization , 2015, Soft Computing.

[13]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

[14]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[15]  Carlos M. Fonseca,et al.  An Improved Dimension-Sweep Algorithm for the Hypervolume Indicator , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[16]  Xin Yao,et al.  Diversity Assessment in Many-Objective Optimization , 2017, IEEE Transactions on Cybernetics.

[17]  Jason R. Schott Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[18]  Jun Zhang,et al.  Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms , 2014, IEEE Transactions on Evolutionary Computation.

[19]  Michael G. Epitropakis,et al.  Progressive preference articulation for decision making in multi-objective optimisation problems , 2017, Integr. Comput. Aided Eng..

[20]  Konstantinos Liagkouras,et al.  A new Probe Guided Mutation operator and its application for solving the cardinality constrained portfolio optimization problem , 2014, Expert Syst. Appl..

[21]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[22]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[23]  Ferrante Neri,et al.  Covariance matrix adaptation pareto archived evolution strategy with hypervolume-sorted adaptive grid algorithm , 2016, Integr. Comput. Aided Eng..

[24]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[25]  J. D. Schaffer,et al.  Combinations of genetic algorithms and neural networks: a survey of the state of the art , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.

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

[27]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[28]  Kalyanmoy Deb,et al.  Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization , 2008, Eur. J. Oper. Res..

[29]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[30]  Hua Xu,et al.  An Experimental Investigation of Variation Operators in Reference-Point Based Many-Objective Optimization , 2015, GECCO.

[31]  Xiao-Shan Gao,et al.  Evolutionary programming based on non-uniform mutation , 2007, Appl. Math. Comput..

[32]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[33]  Abdullah Al Mamun,et al.  Balancing exploration and exploitation with adaptive variation for evolutionary multi-objective optimization , 2009, Eur. J. Oper. Res..

[34]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[35]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

[37]  Ferrante Neri,et al.  A fast hypervolume driven selection mechanism for many-objective optimisation problems , 2017, Swarm Evol. Comput..

[38]  Xin Yao,et al.  A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

[39]  Ferrante Neri,et al.  An Optimization Spiking Neural P System for Approximately Solving Combinatorial Optimization Problems , 2014, Int. J. Neural Syst..