Infeasible Elitists and Stochastic Ranking Selection in Constrained Evolutionary Multi-objective Optimization
To handle the constrained multi-objective evolutionary optimization problems, the authors firstly analyze Deb’s constrained-domination principle (DCDP) and point out that it more likely stick into local optimum on these problems with two or more disconnected feasible regions. Secondly, to handle constraints in multi-objective optimization problems (MOPs), a new constraint handling strategy is proposed, which keeps infeasible elitists to act as bridges connecting disconnected feasible regions besides feasible ones during optimization and adopts stochastic ranking to balance objectives and constraints in each generation. Finally, this strategy is applied to NSGA-II, and then is compared with DCDP on six benchmark constrained MOPs. Our results demonstrate that distribution and stability of the solutions are distinctly improved on the problems with two or more disconnected feasible regions, such as CTP6.
Index TermsConstraint multi-objective optimization infeasible elitists stochastic ranking
Unable to display preview. Download preview PDF.
- 1.Schaffer, J.D.: Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. In: Proc. 1st International Conference on Genetic Algorithms, Hillsdale, pp. 93–100 (1985)Google Scholar
- 4.Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Tech. Rep. 103, Gloriastrasse 35, CH-8092 Zurich, Switzerland (2001)Google Scholar
- 8.Bui, L.T., Branke, J., Abbass, H.A.: Multiobjective optimization for dynamic environments. In: CEC 2005, vol. 3, pp. 2349–2356 (2005)Google Scholar
- 14.Zhang, M., Geng, H., Luo, W., et al.: A Novel Search Biases Selection Strategy for Constrained Evolutionary Optimization. In: CEC 2006 (to appear)Google Scholar