학술논문

Imperialist Competitive Algorithm Using Chaos Theory for Optimization (CICA)
Document Type
Conference
Source
2010 12th International Conference on Computer Modelling and Simulation Computer Modelling and Simulation (UKSim), 2010 12th International Conference on. :98-103 Mar, 2010
Subject
Computing and Processing
General Topics for Engineers
Chaos
Independent component analysis
Evolutionary computation
Benchmark testing
Evolution (biology)
Genetic algorithms
Computational modeling
Computer simulation
Absorption
Particle swarm optimization
Imperialist Competitive Algorithm
absorption policy
chaos theory
Language
Abstract
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