Ensemble of Constraint Handling Techniques

被引:357
作者
Mallipeddi, Rammohan [1 ]
Suganthan, Ponnuthurai N. [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
关键词
Constrained optimization; differential evolution; ensemble of constraint handling techniques; ensemble of optimization algorithms; evolutionary programming; EVOLUTIONARY ALGORITHMS; DIFFERENTIAL EVOLUTION; MEMETIC ALGORITHMS; OPTIMIZATION; SEARCH;
D O I
10.1109/TEVC.2009.2033582
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
During the last three decades, several constraint handling techniques have been developed to be used with 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, multimodality of the problem, the chosen EA, and global exploration/local exploitation stages of the search process, different constraint handling methods can be effective during different stages of the search process. Motivated by these observations, we propose an ensemble of constraint handling techniques (ECHT) to solve constrained real-parameter optimization problems, where each constraint handling method has its own population. A distinguishing feature of the ECHT is the usage of every function call by each population associated with each constraint handling technique. Being a general concept, the ECHT can be realized with any existing EA. In this paper, we present two instantiations of the ECHT using four constraint handling methods with the evolutionary programming and differential evolution as the EAs. Experimental results show that the performance of ECHT is better than each single constraint handling method used to form the ensemble with the respective EA, and competitive to the state-of-the-art algorithms.
引用
收藏
页码:561 / 579
页数:19
相关论文
共 47 条
[1]  
[Anonymous], 1966, Artificial_Intelligence_Through_Simulated Evolution
[2]  
[Anonymous], 2006005 NAN TECHN U
[3]   Self-adaptive differential evolution algorithm in constrained real-parameter optimization [J].
Brest, Janez ;
Zumer, Viljem ;
Maucec, Mirjam Sepesy .
2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, :215-+
[4]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[5]   Differential Evolution Using a Neighborhood-Based Mutation Operator [J].
Das, Swagatam ;
Abraham, Ajith ;
Chakraborty, Uday K. ;
Konar, Amit .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (03) :526-553
[6]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[7]   Self-adaptive fitness formulation for constrained optimization [J].
Farmani, R ;
Wright, JA .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (05) :445-455
[8]  
Fogel D.B., 1991, SYSTEM IDENTIFICATIO
[9]  
Hamida SB, 2002, IEEE C EVOL COMPUTAT, P884, DOI 10.1109/CEC.2002.1007042
[10]   Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling [J].
Ishibuchi, H ;
Yoshida, T ;
Murata, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :204-223