Imperialist Competitive Algorithm using Chaos Theory for Optimization (CICA)

被引:30
作者
Bahrami, Helena [1 ]
Faez, Karim [2 ]
Abdechiri, Marjan [1 ]
机构
[1] Qazvin Azad Univ, Dept Elec Comp & IT, Qazvin, Iran
[2] Amirkabir Univ Tehran, Dept EE, Tehran, Iran
来源
2010 12TH INTERNATIONAL CONFERENCE ON COMPUTER MODELLING AND SIMULATION (UKSIM) | 2010年
关键词
Imperialist Competitive Algorithm; absorption policy; chaos theory;
D O I
10.1109/UKSIM.2010.26
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The Imperialist Competitive Algorithm (ICA) that was recently introduced 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. In this paper a new Imperialist Competitive Algorithm using chaotic maps (CICA) is proposed. In the proposed algorithm, the chaotic maps are used to adapt the angle of colonies movement towards imperialist's position to enhance the escaping capability from a local optima trap. The ICA is easily stuck into a local optimum when solving high-dimensional multi-model numerical optimization problems. To overcome this shortcoming, we use four different chaotic map incorporated into ICA to enhance the exploration capability. Some famous unconstraint benchmark functions are used to test the CICA performance. Simulation results show this variant can improve the performance significantly.
引用
收藏
页码:98 / 103
页数:6
相关论文
共 21 条
  • [1] [Anonymous], 1992, NEW FRONTIERS SCI
  • [2] Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083
  • [3] A simulated annealing approach to the solution of MINLP problems
    Cardoso, MF
    Salcedo, RL
    de Azevedo, SF
    Barbosa, D
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 1997, 21 (12) : 1349 - 1364
  • [4] Self-adapting Chaos-genetic Hybrid Algorithm with Mixed Congruential Method
    Chen Bing-rui
    Feng Xia-ting
    [J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS, 2008, : 674 - 677
  • [5] Franklin B, 2000, IEEE C EVOL COMPUTAT, P1245, DOI 10.1109/CEC.2000.870793
  • [6] Path Planning for Mobile Robot Based on Chaos Genetic Algorithm
    Gao, Meijuan
    Xu, Jin
    Tian, Jingwen
    Wu, Hao
    [J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2008, : 409 - +
  • [7] Holland J. H., 1990, P 2 C ART LIF
  • [8] SIMULATED ANNEALING - PRACTICE VERSUS THEORY
    INGBER, L
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1993, 18 (11) : 29 - 57
  • [9] JIN X, 1999, P C EV COMP CEC 1999, V3, P1672
  • [10] Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968