It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Wind energy has emerged as a potential replacement for fossil fuel-based energy sources. To harness maximum wind energy, a crucial decision in the development of an efficient wind farm is the optimal layout design. This layout defines the specific locations of the turbines within the wind farm. The process of finding the optimal locations of turbines, in the presence of various technical and technological constraints, makes the wind farm layout design problem a complex optimization problem. This problem has traditionally been solved with nature-inspired algorithms with promising results. The performance and convergence of nature-inspired algorithms depend on several parameters, among which the algorithm termination criterion plays a crucial role. Timely convergence is an important aspect of efficient algorithm design because an inefficient algorithm results in wasted computational resources, unwarranted electricity consumption, and hardware stress. This study provides an in-depth analysis of several termination criteria while using the genetic algorithm as a test bench, with its application to the wind farm layout design problem while considering various wind scenarios. The performance of six termination criteria is empirically evaluated with respect to the quality of solutions produced and the execution time involved. Due to the conflicting nature of these two attributes, fuzzy logic-based multi-attribute decision-making is employed in the decision process. Results for the fuzzy decision approach indicate that among the various criteria tested, the criterion Phi achieves an improvement in the range of 2.44% to 32.93% for wind scenario 1. For scenario 2, Best-worst termination criterion performed well compared to the other criteria evaluated, with an improvement in the range of 1.2% to 9.64%. For scenario 3, Hitting bound was the best performer with an improvement of 1.16% to 20.93%.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer