An orthogonal design based constrained evolutionary optimization algorithm

被引:45
作者
Wang, Yong [1 ]
Liu, Hui
Cai, Zixing
Zhou, Yuren
机构
[1] Cent S Univ, Sch Informat Sci & Engn, Changsha 410083, Peoples R China
[2] S China Univ Technol, Sch Engn & Comp Sci, Guangzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
constrained optimization; orthogonal design; multi-objective optimization; non-dominated individuals;
D O I
10.1080/03052150701280541
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Solving constrained optimization problems (COPS) via evolutionary algorithms (EAs) has attracted much attention. In this article, an orthogonal design based constrained optimization evolutionary algorithm (ODCOEA) to tackle COPS is proposed. In principle, ODCOEA belongs to a class of steady state evolutionary algorithms. In the evolutionary process, several individuals are chosen from the population as parents and orthogonal design is applied to pairs of parents to produce a set of representative offspring. Then, after combining the offspring generated by different pairs of parents, non-dominated individuals are chosen. Subsequently, from the parent's perspective, it is decided whether a nondominated individual replaces a selected parent. Finally, ODCOEA incorporates an improved BGA mutation operator to facilitate the diversity of the population. The proposed ODCOEA is effectively applied to 12 benchmark test functions. The computational experiments show that ODCOEA not only quickly converges to optimal or near-optimal solutions, but also displays a very high performance compared with another two state-of-the-art techniques.
引用
收藏
页码:715 / 736
页数:22
相关论文
共 32 条
[1]   Handling constraints using multiobjective optimization concepts [J].
Aguirre, AH ;
Riondal, SB ;
Coello, CAC ;
Lizárraga, GL ;
Montes, EM .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2004, 59 (15) :1989-2017
[2]   A multiobjective optimization-based evolutionary algorithm for constrained optimization [J].
Cai, Zixing ;
Wang, Yong .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :658-675
[3]   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
[4]   Constraint-handling in genetic algorithms through the use of dominance-based tournament selection [J].
Coello, CAC ;
Montes, EM .
ADVANCED ENGINEERING INFORMATICS, 2002, 16 (03) :193-203
[5]   Treating constraints as objectives for single-objective evolutionary optimization [J].
Coello, CAC .
ENGINEERING OPTIMIZATION, 2000, 32 (03) :275-308
[6]   Constraint-handling using an evolutionary multiobjective optimization technique [J].
Coello, CAC .
CIVIL ENGINEERING AND ENVIRONMENTAL SYSTEMS, 2000, 17 (04) :319-346
[7]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   Self-adaptive fitness formulation for constrained optimization [J].
Farmani, R ;
Wright, JA .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (05) :445-455
[10]   Multiobjective optimization and multiple constraint handling with evolutionary algorithms - Part I: A unified formulation [J].
Fonseca, CM ;
Fleming, PJ .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1998, 28 (01) :26-37