基于帝国分裂的帝国竞争算法优化

被引:12
作者
郭婉青
叶东毅
机构
[1] 福州大学数学与计算机科学学院
关键词
优化算法; 帝国竞争算法; 帝国分裂; 扰动策略;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
帝国竞争算法(ICA)是一种受帝国竞争行为启发的新的群智能优化算法。在ICA的迭代过程中,帝国个数不断减少,导致群体多样性降低,这对于高维多模优化问题的求解是不利的,算法容易陷入局部最优。为了克服这个缺陷,引入一种帝国分裂机制,同时增加扰动策略,使算法性能显著提高,在求解高维优化问题上取得明显的改进效果。对多个标准测试函数进行了实验,结果验证了该算法的优良特性,表明适当的分裂策略和扰动策略对于提高ICA的性能是有效的。
引用
收藏
页码:86 / 90
页数:5
相关论文
共 6 条
[1]
Imperialist Competitive Algorithms with Perturbed Moves for Global Optimization.[J].Chun Huy Wang.Applied Mechanics and Materials.2013, 284
[2]
Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism [J].
Karimi, N. ;
Zandieh, M. ;
Najafi, A. A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (16) :4965-4977
[3]
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties [J].
Behnamian, J. ;
Zandieh, M. .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (12) :14490-14498
[4]
A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem [J].
Shokrollahpour, E. ;
Zandieh, M. ;
Dorri, Behrouz .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (11) :3087-3103
[5]
Application of an imperialist competitive algorithm to the design of a linear induction motor [J].
Lucas, Caro ;
Nasiri-Gheidari, Zahra ;
Tootoonchian, Farid .
ENERGY CONVERSION AND MANAGEMENT, 2010, 51 (07) :1407-1411
[6]
An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems [J].
Forouharfard, S. ;
Zandieh, M. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 51 (9-12) :1179-1193