Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/2495
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKoç, İsmail-
dc.date.accessioned2022-05-23T20:23:43Z-
dc.date.available2022-05-23T20:23:43Z-
dc.date.issued2022-
dc.identifier.issn0957-4174-
dc.identifier.issn1873-6793-
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2022.116835-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/2495-
dc.description.abstractWind energy has attracted great attention in recent years due to the increasing demand for alternative energy sources. Gathering the maximum amount of energy from wind energy is directly related to the layout of wind turbines in wind farm. This study focuses on grid-based wind turbine layout problem in an area of 2 km x 2 km. In order to solve this problem, 9 novel grids of 11 x 11, 12 x 12, ... and 19 x 19 are proposed in this paper in addition to 10 x 10 and 20 x 20 turbine grids which have already used in the literature. A new repair operator is recommended, taking into account the distance constraint between two adjacent cells in turbine layout problem, and thus the obtained solutions are made feasible. Furthermore, a levy flight-based IWO (LFIWO) algorithm is developed to optimize the layout of the turbines in wind farm. The basic IWO algorithm and the proposed LFIWO algorithm are compared on 11 different turbine layouts. Experimental studies are carried out for both algorithms under equal conditions with the help of 10 different binary versions. According to the comparisons performed using 11 different grids, LFIWO demonstrates a much superior success than the IWO algorithm. In addition, the proposed 19 x 19 grid reveals the best success among the other grids. When compared to the other studies in the literature, it is seen that LFIWO surpasses the other algorithms in terms of solution quality. As a result, it can be clearly stated that the proposed binary version of LFIWO is a competitive and effective binary algorithm.en_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.ispartofExpert Systems With Applicationsen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectInvasive weed optimizationen_US
dc.subjectLevy flighten_US
dc.subjectWind turbine placementen_US
dc.subjectTurbine layouten_US
dc.subjectBinary algorithmen_US
dc.subjectParticle Swarm Optimizationen_US
dc.subjectFarm Layouten_US
dc.subjectGenetic Algorithmen_US
dc.subjectDesign Optimizationen_US
dc.subjectOptimal Placementen_US
dc.subjectPower Productionen_US
dc.subjectModelen_US
dc.subjectSystemen_US
dc.subjectMutationen_US
dc.titleA comprehensive analysis of grid-based wind turbine layout using an efficient binary invasive weed optimization algorithm with levy flighten_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.eswa.2022.116835-
dc.identifier.scopus2-s2.0-85126125127en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Yazılım Mühendisliği Bölümüen_US
dc.identifier.volume198en_US
dc.identifier.wosWOS:000792157000004en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
item.languageiso639-1en-
item.fulltextWith Fulltext-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextembargo_20300101-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept02.13. Department of Software Engineering-
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections
Files in This Item:
File SizeFormat 
1-s2.0-S0957417422002883-main.pdf
  Until 2030-01-01
3.77 MBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

WEB OF SCIENCETM
Citations

9
checked on Apr 20, 2024

Page view(s)

118
checked on Apr 22, 2024

Download(s)

6
checked on Apr 22, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.