A robust evolutionary algorithm for global optimization
檔案
- 000178078200001.pdf (233.9 KB, Adobe PDF)
日期
2002
類型
期刊名稱
ENGINEERING OPTIMIZATION
卷期與頁次
第 34 卷第 5 期,頁 405–425
ISSN
0305-215X
語言
英文
摘要
This paper studies an evolutionary algorithm for global optimization. Based on family competition and adaptive rules, the proposed approach consists of global and local strategies by integrating decreasing-based mutations and self-adaptive mutations. The proposed approach is experimentally analyzed by showing that its components can integrate with one another and possess good local and global properties. Following the description of implementation details, the approach is then applied to several widely used test sets, including problems from international contests on evolutionary optimization. Numerical results indicate that the new approach performs very robustly and is competitive with other well-known evolutionary algorithms.