An imperialist competitive algorithm for solving constrained optimization problem

被引:0
作者
Lei D.-M. [1 ]
Cao S.-Q. [1 ]
Li M. [1 ]
机构
[1] School of Automation, Wuhan University of Technology, Wuhan
来源
Kongzhi yu Juece/Control and Decision | 2019年 / 34卷 / 08期
关键词
Assimilation; Constrained optimization problem; Imperialist competitive algorithm; Lexicographical method; Revolution;
D O I
10.13195/j.kzyjc.2018.0007
中图分类号
学科分类号
摘要
To solve a constrained optimization problem, a new strategy is proposed, in which the lexicographical method is used to simultaneously optimize the objective function and the degree of constraint violation. A novel imperialist competitive algorithm (ICA) is presented, in which, cost and normalized cost are redefined to guarantee that the power of all imperialists exceeds zero, and some strategies such as the global search of colonies in assimilation, excellent colonies based revolution, differential evolution of imperialists and a new approach of imperialist competition are applied to improve solution quality. Many experiments are conducted based on two groups of test functions, and the ICA is compared with some algorithms from literature. The computational results show that the ICA with the lexicographical method has promising advantages for solving constrained optimization problems. © 2019, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:1663 / 1671
页数:8
相关论文
共 42 条
[1]  
Li Z.Y., Huang T., Chen S.M., Et al., Overview of constrained optimization evolutionary algorithms, J of Software, 28, 6, pp. 1529-1546, (2017)
[2]  
Wang Y., Cai Z.X., Zhou Y.R., Constrained optimization evolutionary algorithm, J of Software, 20, 1, pp. 11-29, (2009)
[3]  
Mezura-Montes E., Coello C.A.C., Constraint-handling in nature-inspired numerical optimization: Past, present and future, Swarm and Evolutionary Computation, 1, 4, pp. 173-194, (2011)
[4]  
Gong W., Cai Z.H., Liang D.W., Adaptive ranking mutation operator based differential evolution for constrained optimization, IEEE Trans on Cybernetics, 45, 4, pp. 716-727, (2015)
[5]  
Saha A., Datta R., Deb K., Hybrid gradient projection based genetic algorithms for constrained optimization, Proc of the Congress on Evolutionary Computation, pp. 2851-2858, (2010)
[6]  
Runarsson T.P., Yao X., Stochastic ranking for constrained evolutionary optimization, IEEE Trans on Evolutionary Computation, 4, 3, pp. 284-294, (2000)
[7]  
Takahama T., Sakai S., Constrained optimization by the " constrained differential evolution with gradient-based mutation and feasible elites, Proc of the 2006 IEEE Int Conf on Evolutionary Computation, pp. 372-378, (2006)
[8]  
Wang Y., Cai Z.X., Guo G.Q., Et al., Multi-objective optimization and hybrid evolutionary algorithm to solve constrained optimization problems, IEEE Trans on Systems, Man, and Cybernetics, 37, 3, pp. 560-575, (2007)
[9]  
Peng S.Y., Hybrid immune clonal particle swarm optimization multi-objective algorithm for constrained optimization problems, Int J of Patter Recognition and Artificial Intelligence, 31, 1, pp. 2495-2508, (2017)
[10]  
Mallipeddi R., Suganthan P.N., Ensemble of constraint handling techniques, IEEE Trans on Evolutionary Computation, 14, 4, pp. 561-579, (2010)