A New Hybrid Intelligent Search Method to Find Global Optimal Solution for Engineering Problems

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

The complexity of engineering problems and the existence of various constraints on these issues, encourage the researchers to use of innovative methods based on a heuristic algorithm to find the optimal solution for practical problems at a cost-effective time and non-consistency tolerance. A distinction has been made between various issues and, therefore, extensive research has been done to improve heuristic algorithms in order to enhance their ability to solve engineering and practical problems. In this paper, due to the ability to global search some of the metaheuristic search patterns (such as the EMA algorithm) and the ability to local search for some meta-heuristic search patterns (such as the FPA algorithm), a novel combination method is proposed to use the ability of both types of algorithms. Then, using the proposed method, a hybrid search pattern with new abilities is presented, whose abilities are proven on standard benchmark testing functions as well as solving engineering problems.

Language:
Persian
Published:
Journal of Modeling in Engineering, Volume:17 Issue: 58, 2019
Pages:
81 to 102
magiran.com/p2152348  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!