Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/2371
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kıran, Mustafa Servet | - |
dc.contributor.author | Yunusova, P. | - |
dc.date.accessioned | 2022-05-23T20:07:30Z | - |
dc.date.available | 2022-05-23T20:07:30Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 2147-6799 | - |
dc.identifier.uri | https://doi.org/10.18201/ijisae.2022.278 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/2371 | - |
dc.description.abstract | Tree-Seed algorithm, TSA for short, is a population-based metaheuristic optimization algorithm proposed for solving continuous optimization problems inspired by the relation between trees and their seeds in nature. The artificial agents in TSA are trees and seeds which correspond to possible solutions to the optimization problem, and the optimization procedure is executed by the interaction between trees and seeds. In this study, a programming version of this algorithm by using a crossover solution generation mechanism has been proposed. The proposed algorithm is called TSp and its performance has been investigated on two problems, one of them is symbolic regression benchmark functions and the other is the long-term energy estimation model of Turkey. Firstly, the continuous parts of TSA, which are initialization and solution generation mechanisms, have been modified to solve automatic programming problems. The solution representation is also modified to solve the problem addressed by the study. As a result of these modifications, TSp has been obtained and applied to symbolic regression problems for performance judgment, energy estimation problems for real-world application. The experimental results of TSp have been compared with those of Genetic Programming, it is concluded that TSp is better than the GP in solving energy estimation problems. © 2022, Ismail Saritas. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Ismail Saritas | en_US |
dc.relation.ispartof | International Journal of Intelligent Systems and Applications in Engineering | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Automatic programming | en_US |
dc.subject | energy estimation and modelling | en_US |
dc.subject | genetic programming | en_US |
dc.subject | swarm intelligence | en_US |
dc.subject | tree-seed algorithm | en_US |
dc.title | Tree-Seed Programming for Modelling of Turkey Electricity Energy Demand | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.18201/ijisae.2022.278 | - |
dc.identifier.scopus | 2-s2.0-85128232761 | 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 | 10 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.startpage | 142 | en_US |
dc.identifier.endpage | 152 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 54403096500 | - |
dc.authorscopusid | 57575146000 | - |
dc.identifier.trdizinid | 517238 | en_US |
dc.identifier.scopusquality | Q3 | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
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 TR Dizin İndeksli Yayınlar Koleksiyonu / TR Dizin Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
document (93).pdf | 547.34 kB | Adobe PDF | View/Open |
CORE Recommender
Page view(s)
192
checked on Oct 14, 2024
Download(s)
116
checked on Oct 14, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.