دوره 11، شماره 2 - ( 3-1400 )                   جلد 11 شماره 2 صفحات 356-329 | برگشت به فهرست نسخه ها

XML English Abstract Print


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

Kaveh A, Biabani Hamedani K, Kamalinejad M, Joudaki A. QUANTUM-BASED JELLYFISH SEARCH OPTIMIZER FOR STRUCTURAL OPTIMIZATION. International Journal of Optimization in Civil Engineering 2021; 11 (2) :329-356
URL: http://ijoce.iust.ac.ir/article-1-477-fa.html
QUANTUM-BASED JELLYFISH SEARCH OPTIMIZER FOR STRUCTURAL OPTIMIZATION. عنوان نشریه. 1400; 11 (2) :329-356

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


چکیده:   (7689 مشاهده)
Jellyfish Search (JS) is a recently developed population-based metaheuristic inspired by the food-finding behavior of jellyfish in the ocean. The purpose of this paper is to propose a quantum-based Jellyfish Search algorithm, named Quantum JS (QJS), for solving structural optimization problems. Compared to the classical JS, three main improvements are made in the proposed QJS: (1) a quantum-based update rule is adopted to encourage the diversification in the search space, (2) a new boundary handling mechanism is used to avoid getting trapped in local optima, and (3) modifications of the time control mechanism are added to strike a better balance between global and local searches. The proposed QJS is applied to solve frequency-constrained large-scale cyclic symmetric dome optimization problems. To the best of our knowledge, this is the first time that JS is applied in frequency-constrained optimization problems. An efficient eigensolution method for free vibration analysis of rotationally repetitive structures is employed to perform structural analyses required in the optimization process. The efficient eigensolution method leads to a considerable saving in computational time as compared to the existing classical eigensolution method. Numerical results confirm that the proposed QJS considerably outperforms the classical JS and has superior or comparable performance to other state-of-the-art optimization algorithms. Moreover, it is shown that the present eigensolution method significantly reduces the required computational time of the optimization process compared to the classical eigensolution method.
متن کامل [PDF 743 kb]   (3027 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: 1400/3/29 | پذیرش: 1400/3/9 | انتشار: 1400/3/9

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
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