Niching Imperialistic Competitive Algorithm
Publish place: 21th Iranian Conference on Electric Engineering
Publish Year: 1392
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,083
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICEE21_737
تاریخ نمایه سازی: 27 مرداد 1392
Abstract:
Evolutionary computing techniques are among powerful tools for solving optimization problems. Imperialistic competitive algorithm is an evolutionary optimization algorithmthat has been shown to be successful for locating global optima. However in real world problems, it is critical to locate multiplesatisfactory solutions. This paper describes an optimization algorithm based on Imperialistic competitive algorithm for solving multimodal problems. The proposed method avoids using any prior knowledge about landscape of problem. It is capable of locating and maintaining found local and global optima duringthe run time. In order to avoid using any parameter for determining the size of niches within the landscape, algorithmadaptively adjusts its parameter according to the current population’s information. The proposed algorithm is tested on nine commonly used multimodal problems. Experimental results suggest that the proposed method is able to provide a superior performance or the same performance in some test functions over other existing multimodal algorithms
Keywords:
Authors
Hossein Talebi
Isfahan University of Technology
S. Ali Shetab Boushehri
Isfahan University of Technolo