TY - GEN
T1 - Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
AU - Mallipeddi, Rammohan
AU - Suganthan, Ponnuthurai Nagaratnam
PY - 2010
Y1 - 2010
N2 - Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single constraint handling technique to outperform all other techniques on every problem. In other words, depending on several factors such as the ratio between feasible search space and the whole search space, multi-modality of the problem, the chosen EA and global exploration/local exploitation stages of the search process, different constraint handling techniques can be effective on different problems and during different stages of the search process. Motivated by these observations, we proposed an ensemble of constraint handling techniques (ECHT) to solve constrained real-parameter optimization problems. In ECHT, each constraint handling method has its own population and every function call is used effectively. Being a general concept, the ECHT can be realized with any existing EA. In this paper, we present ECHT with Differential Evolution (DE) as the basic search algorithm (ECHT-DE). The ECHT is formed using four different constraint handling techniques present in the literature. ECHT-DE is evaluated on the functions from CEC 2010 problem set.
AB - Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single constraint handling technique to outperform all other techniques on every problem. In other words, depending on several factors such as the ratio between feasible search space and the whole search space, multi-modality of the problem, the chosen EA and global exploration/local exploitation stages of the search process, different constraint handling techniques can be effective on different problems and during different stages of the search process. Motivated by these observations, we proposed an ensemble of constraint handling techniques (ECHT) to solve constrained real-parameter optimization problems. In ECHT, each constraint handling method has its own population and every function call is used effectively. Being a general concept, the ECHT can be realized with any existing EA. In this paper, we present ECHT with Differential Evolution (DE) as the basic search algorithm (ECHT-DE). The ECHT is formed using four different constraint handling techniques present in the literature. ECHT-DE is evaluated on the functions from CEC 2010 problem set.
UR - https://www.scopus.com/pages/publications/79959443028
U2 - 10.1109/CEC.2010.5586330
DO - 10.1109/CEC.2010.5586330
M3 - Conference contribution
AN - SCOPUS:79959443028
SN - 9781424469109
T3 - 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
BT - 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
T2 - 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
Y2 - 18 July 2010 through 23 July 2010
ER -