Efficient evolutionary optimization through the use of a cultural algorithm

被引:186
作者
Coello, CAC [1 ]
Becerra, RL [1 ]
机构
[1] CINVESTAV, IPN, Evolutionary Computat Grp, Dept Ingn Elect,Secc Computac, Mexico City 07300, DF, Mexico
关键词
cultural algorithms; evolutionary programming; constrained optimization;
D O I
10.1080/03052150410001647966
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper introduces a cultural algorithm that uses domain knowledge to improve the performance of an evolutionary programming technique adopted for constrained optimization. The proposed approach extracts domain knowledge during the evolutionary process and builds a map of the feasible region to guide the search more efficiently. Additionally, in order to have a more efficient memory management scheme, the current implementation uses 2(n)-trees to store this map of the feasible region. Results indicate that the approach is able to produce very competitive results with respect to other optimization techniques at a considerably lower computational cost.
引用
收藏
页码:219 / 236
页数:18
相关论文
共 35 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]  
Arora J., 2004, Introduction to Optimum Design
[3]  
Back T., 1997, HDB EVOLUTIONARY COM, V1
[4]  
Belegundu A.D., 1982, STUDY MATH PROGRAMMI
[5]  
BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797
[6]  
Chung C, 1997, THESIS WAYNE STATE U
[7]  
CHUNG CJ, 1996, EVOLUTIONARY PROGRAM, V5
[8]   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
[9]   CONSTRAINT PROPAGATION WITH INTERVAL LABELS [J].
DAVIS, E .
ARTIFICIAL INTELLIGENCE, 1987, 32 (03) :281-331
[10]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338