INVESTIGATION OF REVOLUTION OPERATOR IN IMPERIALIST COMPETITIVE ALGORITHM (ICA)

被引：0

作者：

Soltani-Sarvestani, M. A. ^{[1
]}

Badamchizadeh, M. A. ^{[2
]}

Soltani-Sarvestani, Sh. ^{[3
]}

Javanray, Delaram ^{[4
]}

机构：

[1] Univ Collage Nabi Akram, Dept Comp Sci, Tabriz, Iran

[2] Univ Tabriz, Fac Elect & Comp Engn, Tabriz, Iran

[3] Islamic Azad Univ, Dept Comp Sci, Shiraz, Iran

[4] Azad Univ, Dept Comp Sci, Marvdasht, Iran

来源：

FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING (ICCEE 2011) | 2011年

关键词：

Optimization; Imperialist Competitive Algorithm (ICA); Revolution;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper reviews the effects of revolution operator in Imperialist Competitive Algorithm (ICA). The Imperialist Competitive Algorithm that was recently introduced and this algorithm has shown its good performance in optimization problems. This novel optimization algorithm is inspired by socio-political process of imperialistic competition in the real world. This algorithm converges fast but in high dimensional problems, this algorithm easily stuck into local optima. The strategy of this algorithm for escaping from local optima is revolution operator. The revolution is an operator which changes the position of a spot. The revolution operator can be applied in N different form for a N-Dimension problem. These N different form include revolution with 1, 2, ... and N dimension and the results of each one is different from others. In this paper, the effect of dimension's number in revolution operator has been reviewed in Imperialist Competitive Algorithm for multi-objective optimization problems. The revolution operator in basic algorithm choice randomly one of variables and changes its value randomly in each iteration. In this paper, ICA algorithm has been tested under some well-known benchmarks and with comparison of results, the best method for revolution is introduced in order to increasing performance of the ICA.

引用

页码：255 / +

页数：2

共 10 条

[1]

Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083

[2]

Bahrami H., 2010, P 9 IEEE INT C COGN

[3]

Bahrami H., 2010, P 12 INT C COMP MOD

[4] Colonial competitive algorithm A novel approach for PID controller design in MIMO distillation column process [J].

Gargari, Esmaeil Atashpaz ;

Hashemzadeh, Farzad ;

Rajabioun, Ramin ;

Lucas, Caro .

INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2008, 1 (03) :337-355

[5]

Holland J.H., P 2 C ART LIF 1990

[6]

Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968

[7]

Melanie M, 1999, An introduction to genetic algorithms

[8]

Muhlenbein H., 1991, Proc. 4th International Conf. on Genetic Algorithm, University of California, P270

[9] A line up evolutionary algorithm for solving nonlinear constrained optimization problems [J].

Sarimveis, H ;

Nikolakopoulos, A .

COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) :1499-1514

[10]

Zhang Y., 2009, INT FORUM COMPUTER S

← 1 →