دانلود رایگان مقاله الگوریتم جستجوی هارمونی مبتنی بر مسابقات

عنوان فارسی
الگوریتم جستجوی هارمونی مبتنی بر مسابقات برای مشکل اعزام بار اقتصادی به صورت غیر محدب
عنوان انگلیسی
Tournament-based harmony search algorithm for non-convex economic load dispatch problem
صفحات مقاله فارسی
0
صفحات مقاله انگلیسی
11
سال انتشار
2016
نشریه
الزویر - Elsevier
فرمت مقاله انگلیسی
PDF
کد محصول
E2182
رشته های مرتبط با این مقاله
مهندسی کامپیوتر
گرایش های مرتبط با این مقاله
الگوریتم ها و محاسبات
مجله
محاسبات کاربردی نرم - Applied Soft Computing
دانشگاه
گروه فناوری اطلاعات، دانشگاه کالج آل Huson،دانشگاه کاربردی آل بلقاء، اردن
کلمات کلیدی
اعزام بار اقتصادی، الگوریتم جستجوی هارمونی، انتخاب مسابقه، سیستم های قدرت، بهینه سازی جهانی
چکیده

ABSTRACT


This paper proposes a tournament-based harmony search (THS) algorithm for economic load dispatch (ELD) problem. The THS is an efficient modified version of the harmony search (HS) algorithm where the random selection process in the memory consideration operator is replaced by the tournament selection process to activate the natural selection of the survival-of-the-fittest principle and thus improve the convergence properties of HS. The performance THS is evaluated with ELD problem using five different test systems: 3-units generator system; two versions of 13-units generator system; 40-units generator system; and large-scaled 80-units generator system. The effect of tournament size (t) on the performance of THS is studied. A comparative evaluation between THS and other existing methods reported in the literature are carried out. The simulation results show that the THS algorithm is capable of achieving better quality solutions than many of the well-popular optimization methods.

نتیجه گیری

5. Conclusion and future work


This paper proposes a tournament-based harmony search (THS) algorithm for economic load dispatch (ELD) problem. The idea of THS is based on natural selection of the survival-of-the-fittest principle in the memory consideration to improve convergence properties. In THS, the selection process of memory consideration initially generates a tournament of randomly selected individuals stored in HM with size t. Thereafter, the individual with the best objective function value in the tournament is used in the improvisation process. Thus, the THS can be capable of accelerating the convergence rate by means of concentrating on the better individuals during the improvisation of the new harmony at each generation.The convergence characteristics of the THS is evaluated using five different ELD problems. These ELD problems are widely circulated in the literature: 3-units generator system; two versions of ELD with 13-units generator system; 40-units generator system; and large-scaled ELD with 80-units generator system. At the initial stage of evaluations,the effect ofthe tournament size t with varying values is studied. Conclusively,the results in almost alltest systems show thatthe higher the value of “t” is,the better the outcomes will be. Thereafter, to comparably evaluate the outcomes of the proposed THS for ELD, 43 comparative methods known and available for the authors were used for all test systems. The results shows that the THS algorithm is able to achieve the best results for 3-units generator system as obtained by other comparative methods. For the two versions ofthe 13-units generator system,the performance of THS is superior by means of achieving better results than those achieved by other comparative methods. For the 40-units generator system, the results of THS algorithm is ranked eighth out of 35 comparative methods. Lastly, the THS is ranked third in comparison with five comparative methods for solving the ELD with large-scaled 80-units generator system. Practically, the THS could be claimed to be a very efficient algorithm to solve ELD problem in the power system domain.


بدون دیدگاه