p.3909
p.3913
p.3917
p.3921
p.3925
p.3930
p.3935
p.3941
p.3945
Component-Based Ranking Strategy for Evolutionary Optimization with Sparse Constraints
Abstract:
Most constraint-handling methods in constrained evolutionary optimization usually take advantage of only the valuable information of feasible solutions, while they don’t exploit adequately the information from infeasible ones. In this paper, a concept of “feasible component” is introduced to recognize the characteristics of diverse information extracted from infeasible solutions. Then a component-based ranking strategy is proposed for evolutionary optimization with sparse constraints by integrating feasible components and the idea of stochastic ranking. Experimental results on several problems with sparse constraints show that the component-based ranking strategy performs better than the stochastic ranking.
Info:
Periodical:
Pages:
3925-3929
Citation:
Online since:
May 2014
Authors:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: