Comparing and Ranking of Meta-Heuristic Algorithms Using Group Decision Making Methods

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

In recent years, meta-heuristic algorithms and their application in solving complicated, nonlinear and NP-hard problems have dramatically increased, while new algorithms have constantly being introduced. In this research, with the aim of ranking meta-heuristic algorithms, using group decision making techniques (different from other research in this field), 5 algorithms including: GA, PSO, ABC, SFLA and ICA by 15 standard test functions, and considering 2 attribute: "mean of answers" and "run time", have been compared. Then they are ranked by 3 group decision making methods including: "Cook and Seiford", "Condorcet" and "Dodgson". In addition, as in ranking by "Condorcet" and "Dodgson" methods, sometimes some options posit the same rank, therefore, in this study; we presented a proposal to overcome the limitation. Then the algorithms with these proposed methods were ranked. Finally, the overall ranking is done using an allocation model our results show that the overall ranking is as follows, respectively: PSO, ICA, GA, ABC and SFLA.

Language:
Persian
Published:
Journal of Strategic Management in Industrial Systems, Volume:16 Issue: 58, 2022
Pages:
65 to 79
magiran.com/p2394751  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!