Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition

被引:416
作者
Atashpaz-Gargari, Esmaeil [1 ]
Lucas, Caro [1 ]
机构
[1] Univ Tehran, CIPCE, Sch Elect & Comp Engn, Tehran, Iran
来源
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS | 2007年
关键词
D O I
10.1109/CEC.2007.4425083
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
This paper proposes an algorithm for optimization inspired by the imperialistic competition. Like other evolutionary ones, the proposed algorithm starts with an initial population. Population individuals called country are in two types: colonies and imperialists that all together form some empires. Imperialistic competition among these empires forms the basis of the proposed evolutionary algorithm. During this competition, weak empires collapse and powerful ones take possession of their colonies. Imperialistic competition hopefully converges to a state in which there exist only one empire and its colonies are in the same position and have the same cost as the imperialist. Applying the proposed algorithm to some of benchmark cost functions, shows its ability in dealing with different types of optimization problems.
引用
收藏
页码:4661 / 4667
页数:7
相关论文
共 19 条
[1]
ANDRIEU C, 2000, IEEE T INFORM THEORY, V46
[2]
Angeline P.J., P 1 AN C GEN PROGR, P503
[3]
[Anonymous], 2004, PRACTICAL GENETIC AL, DOI DOI 10.1002/0471671746
[4]
BALACI HH, 2004, INT J APPL MATH COMP, V14, P411
[5]
BONTOUX B, COMPUTERS O IN PRESS
[6]
Chellaboina V., 2005, 2005 AM CONTR C JUN
[7]
COLOMBETTI M, EVOLUTIONARY COMPUTA
[8]
DARWEN PJ, 1996 INT C EV COMP N
[9]
Ant colony optimization theory: A survey [J].
Dorigo, M ;
Blum, C .
THEORETICAL COMPUTER SCIENCE, 2005, 344 (2-3) :243-278
[10]
FOGEL DB, BIOL CYBERNETICS, V69, P139