Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Computer and Electrical Engineering 4th (ICCEE 2011)Available to Purchase
By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859841
No. of Pages:
698
Publisher:
ASME Press
Publication date:
2011

This paper introduces an improved evolutionary algorithm based on the Imperialist Competitive Algorithm (ICA), called Imperialist Competitive Algorithm with Moving Imperialists (MICA). The Imperialist Competitive Algorithm that was recently introduced has shown its reliable performance in optimization problems. This novel optimization algorithm is inspired by sociopolitical process of imperialistic competition in the real world. This algorithm converges fastly but is easily stuck into a local optimum when solving high-dimensional optimization problems. The MICA is a strategy proposed in order to increase the performance of ICA and in most cases, to escape the algorithm from local optima trap. In the main ICA the position of Imperialists are fixed while in MICA some of Imperialists have movements for more exploration. In MICA, some of the Imperialists having less power are selected and move in a direction contrary to the other Imperialists. But the best Imperialists do not move unless reach a better position compared to the previous position. Both algorithms tested with some famous benchmarks and results shows better performance for MICA in compare with ICA.

Abstract
Key Words
1 Introduction
2. Introduction of Imperialist Competitive Algorithm (ICA)
3 Imperialist Competitive Algorithm with Moving Imperialists (MICA)
4. Evaluation and Experimental Results
5. Conclusion
References
This content is only available via PDF.
You do not currently have access to this chapter.

or Create an Account

Close Modal
Close Modal