دوره 1، شماره 2 - ( 3-1390 )                   جلد 1 شماره 2 صفحات 325-305 | برگشت به فهرست نسخه ها

XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Talatahari S, Kaveh A, Sheikholeslami R. AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS . IJOCE 2011; 1 (2) :305-325
URL: http://ijoce.iust.ac.ir/article-1-20-fa.html
AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS . عنوان نشریه. 1390; 1 (2) :305-325

URL: http://ijoce.iust.ac.ir/article-1-20-fa.html


چکیده:   (26421 مشاهده)
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods are developed, and then for each variant, the performance of ten different chaotic maps is investigated to identify the most powerful variant. A comparison of these variants and the standard CSS demonstrates the superiority and suitability of the selected variants for the benchmark mathematical optimization problems.
متن کامل [PDF 378 kb]   (7772 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: 1390/8/2 | انتشار: 1390/3/25

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.

کلیه حقوق این وب سایت متعلق به دانشگاه علم و صنعت ایران می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2024 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb