Full Text:   <2962>

CLC number: TP301.6

On-line Access: 2014-05-06

Received: 2013-04-11

Revision Accepted: 2013-12-06

Crosschecked: 2014-04-11

Cited: 6

Clicked: 4538

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE C 2014 Vol.15 No.5 P.363-371

http://doi.org/10.1631/jzus.C1300088


FICA: fuzzy imperialist competitive algorithm


Author(s):  Saeid Arish, Ali Amiri, Khadije Noori

Affiliation(s):  Department of Computer Engineering, University of Zanjan, Zanjan, Iran

Corresponding email(s):   saeed.aiproject@gmail.com, a_amiri@znu.ac.ir, kh.noori90@gmail.com

Key Words:  Optimization problem, Imperialist competitive algorithm (ICA), Fuzzy ICA.


Saeid Arish, Ali Amiri, Khadije Noori. FICA: fuzzy imperialist competitive algorithm[J]. Journal of Zhejiang University Science C, 2014, 15(5): 363-371.

@article{title="FICA: fuzzy imperialist competitive algorithm",
author="Saeid Arish, Ali Amiri, Khadije Noori",
journal="Journal of Zhejiang University Science C",
volume="15",
number="5",
pages="363-371",
year="2014",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.C1300088"
}

%0 Journal Article
%T FICA: fuzzy imperialist competitive algorithm
%A Saeid Arish
%A Ali Amiri
%A Khadije Noori
%J Journal of Zhejiang University SCIENCE C
%V 15
%N 5
%P 363-371
%@ 1869-1951
%D 2014
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.C1300088

TY - JOUR
T1 - FICA: fuzzy imperialist competitive algorithm
A1 - Saeid Arish
A1 - Ali Amiri
A1 - Khadije Noori
J0 - Journal of Zhejiang University Science C
VL - 15
IS - 5
SP - 363
EP - 371
%@ 1869-1951
Y1 - 2014
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.C1300088


Abstract: 
Despite the success of the imperialist competitive algorithm (ICA) in solving optimization problems, it still suffers from frequently falling into local minima and low convergence speed. In this paper, a fuzzy version of this algorithm is proposed to address these issues. In contrast to the standard version of ICA, in the proposed algorithm, powerful countries are chosen as imperialists in each step; according to a fuzzy membership function, other countries become colonies of all the empires. In absorption policy, based on the fuzzy membership function, colonies move toward the resulting vector of all imperialists. In this algorithm, no empire will be eliminated; instead, during the execution of the algorithm, empires move toward one point. Other steps of the algorithm are similar to the standard ICA. In experiments, the proposed algorithm has been used to solve the real world optimization problems presented for IEEE-CEC 2011 evolutionary algorithm competition. Results of experiments confirm the performance of the algorithm.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1]Andreani, R., Birgin, E.G., Martinez, J.M., et al., 2009. Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Progr., 111(1-2):5-32.

[2]Bertsekas, D., Gafni, E., 1983. Projected Newton methods and optimization of multicommodity flows. IEEE Trans. Autom. Contr., 28(12):1090-1096.

[3]Brownlee, J., 2011. Clever Algorithms: Nature-Inspired Programming Recipes (1st Ed.). LuLu Enterprises.

[4]Das, S., Suganthan, P.N., 2010. Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems. Technical Report, Jadavpur University, India, and Nanyang Technological University, Singapore.

[5]Davis, L., 1987. Genetic Algorithms and Simulated Annealing. Morgan Kaufman Publishers, Los Altos, CA.

[6]Fishman, G., 1996. Monte Carlo Concepts, Algorithms and Applications. Chapel-Hill, Springer-Verlag, New York.

[7]Gargari, A., Lucas, E., 2007. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation, p.4661-4667.

[8]Golban, C., Nedevschi, S., 2011. Linear vs. nonlinear minimization in stereo visual odometry. IEEE Int. Intelligent Vehicles Symp., p.888-894.

[9]Guo, P., Wang, X., Han, Y., 2010. The enhanced genetic algorithms for the optimization design. IEEE Conf. on Biomedical Engineering and Informatics, p.2990-2994.

[10]Kaveh, A., Talatahari, S., 2010. Optimum design of skeletal structures using imperialist competitive algorithm. J. Comput. Struct., 88(21):1220-1229.

[11]Kennedy, J., Eberhart, R., 1995. A new optimizer using particle swarm theory. Proceedings 6th International Symposium on Micro Machine and Human Science, p.39-43.

[12]Nelder, J., Mead, R., 1965. A simplex method for function minimization. Comput. J., 7(4):308-313.

[13]Rajabioun, R., 2011. Cuckoo optimization algorithm. Appl. Soft Comput., 11(8):5508-5518.

[14]Talatahari, S., Azar, F., Sheikholeslami, R., et al., 2012. Imperialist competitive algorithm combined with chaos for global optimization. Commun. Nonl. Sci. Numer. Simul., 17(3):1312-1319.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2022 Journal of Zhejiang University-SCIENCE