Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/381
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Çınar, Ahmet | - |
dc.contributor.author | Kıran, Mustafa | - |
dc.date.accessioned | 2021-12-13T10:24:08Z | - |
dc.date.available | 2021-12-13T10:24:08Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 1683-3198 | - |
dc.identifier.uri | https://doi.org/10.34028/iajit/17/5/13 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/381 | - |
dc.description.abstract | The constraints are the most important part of many optimization problems. The metaheuristic algorithms are designed for solving continuous unconstrained optimization problems initially. The constraint handling methods are integrated into these algorithms for solving constrained optimization problems. Penalty approaches are not only the simplest way but also as effective as other constraint handling techniques. In literature, there are many penalty approaches and these are grouped as static, dynamic and adaptive. In this study, we collect them and discuss the key benefits and drawbacks of these techniques. Tree-Seed Algorithm (TSA) is a recently developed metaheuristic algorithm, and in this study, nine different penalty approaches are integrated with the TSA. The performance of these approaches is analyzed on well-known thirteen constrained benchmark functions. The obtained results are compared with state-of-art algorithms like Differential Evolution (DE), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), and Genetic Algorithm (GA). The experimental results and comparisons show that TSA outperformed all of them on these benchmark functions. | en_US |
dc.language.iso | en | en_US |
dc.publisher | ZARKA PRIVATE UNIV | en_US |
dc.relation.ispartof | INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Constrained Optimization | en_US |
dc.subject | Penalty Functions | en_US |
dc.subject | Penalty Approaches | en_US |
dc.subject | Tree-Seed Algorithm | en_US |
dc.subject | Evolutionary Algorithms | en_US |
dc.subject | Genetic Algorithms | en_US |
dc.title | The Performance of Penalty Methods on Tree-Seed Algorithm for Numerical Constrained Optimization Problems | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.34028/iajit/17/5/13 | - |
dc.identifier.scopus | 2-s2.0-85089842127 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.identifier.volume | 17 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.startpage | 799 | en_US |
dc.identifier.endpage | 807 | en_US |
dc.identifier.wos | WOS:000582101100012 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 57207596277 | - |
dc.authorscopusid | 54403096500 | - |
dc.identifier.scopusquality | Q3 | - |
item.grantfulltext | open | - |
item.openairetype | Article | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.03. Department of Computer 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 |
CORE Recommender
SCOPUSTM
Citations
2
checked on May 4, 2024
WEB OF SCIENCETM
Citations
3
checked on May 4, 2024
Page view(s)
170
checked on Apr 29, 2024
Download(s)
94
checked on Apr 29, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.