A Learning Guided Parameter Setting for Constrained Multi-Objective Optimization

This paper proposes a learning guided parameter setting method for constrained multi-objective optimization. To be more specific, the proposed method can generate penalty factors adaptively, which is inspired by the learning rate setting from deep learning. The suggested penalty function employs an exponential decay model by integrating constraint violation values, objectives values, the current generation counter and the maximum number of generations. Furthermore, the proposed self-adaptive penalty method is embedded in the push and pull search framework (PPS-SA) to deal with constrained multi-objective optimization problems (CMOPs). In PPS-SA, the search process is divided into two different stages — push and pull search stages. In the push stage, a CMOP is optimized without considering any constraints. In the pull stage, the CMOP is optimized with a self-adaptive penalty constraint-handling method. To evaluate the performance regarding convergence and diversity, two commonly used metrics, including IGD and HV, are used to test the proposed PPS-SA and other four state-of-the-art CMOEAs, including PPS-MOEA/D, MOEA/D-IEpsilon, MOEA/D-Epsilon and MOEA/D-CDP. The experimental results indicate that the proposed PPS-SA outperforms the other four algorithms in most of the test cases, which demonstrates the superiority of the proposed PPS-SA.

[1]  Xinye Cai,et al.  Epsilon constrained method for constrained multiobjective optimization problems: some preliminary results , 2014, GECCO.

[2]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[3]  Yuping Wang,et al.  A Ranking-Based Evolutionary Algorithm for Constrained Optimization Problems , 2007, Third International Conference on Natural Computation (ICNC 2007).

[4]  Qingfu Zhang,et al.  Push and Pull Search for Solving Constrained Multi-objective Optimization Problems , 2017, Swarm Evol. Comput..

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

[6]  Xinye Cai,et al.  A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[7]  Patrick D. Surry,et al.  The COMOGA Method: Constrained Optimisation by Multi-Objective Genetic Algorithms , 1997 .

[8]  Raphael T. Haftka,et al.  A Segregated Genetic Algorithm for Constrained Structural Optimization , 1995, ICGA.

[9]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[10]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[11]  Zhaoquan Cai,et al.  An improved epsilon constraint handling method embedded in MOEA/D for constrained multi-objective optimization problems , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[12]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[13]  Ling Wang,et al.  An effective co-evolutionary differential evolution for constrained optimization , 2007, Appl. Math. Comput..

[14]  Kalyanmoy Deb,et al.  MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .

[15]  David W. Coit,et al.  Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems , 1996, INFORMS J. Comput..