Boundary Conditions in Tree-Seed Algorithm Analysis of the success of search space limitation techniques in Tree-Seed Algorithm

Basit Öğe Kaydı
dc.contributor.authorCinar, Ahmet Cevahir
dc.contributor.authorKiran, Mustafa Servet
dc.date.accessioned2020-03-26T19:34:09Z
dc.date.available2020-03-26T19:34:09Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description2017 International Conference on Computer Science and Engineering (UBMK) -- OCT 05-08, 2017 -- Antalya, TURKEYen_US
dc.description.abstractSwarm intelligence or evolutionary computation algorithms search possible solutions in a predetermined search space of an optimization problem. In some cases candidate solutions go out of search space during the search. In such situations, search space limitation techniques or boundary conditions are used for sway up this outcast individual into search space. The boundary conditions are classified two main categories whose names are restricted and unrestricted techniques. Restricted boundary conditions forces outcast individual into search space but unrestricted boundary conditions does not force. In this work we use four restricted boundary conditions whose names are Absorbing, Reflecting, Damping and Randomly. Additionally, three unrestricted boundary conditions (Invisible, Invisible Reflecting and Invisible Damping) are used in the study. These boundary conditions are applied in Tree-Seed Algorithm (TSA). The test material is five standard benchmark functions and these arc Sphere, Rastrigin, Rosenbrock, Griewank and Ackley. The main idea of this study is to investigate whether there is a significant difference among the limitation methods in TSA. Experimental results show that there is no significant difference among the boundary conditions methods for TSA.en_US
dc.description.sponsorshipIEEE Adv Technol Human, Istanbul Teknik Univ, Gazi Univ, Atilim Univ, TBV, Akdeniz Univ, Tmmob Bilgisayar Muhendisleri Odasien_US
dc.identifier.endpage576en_US
dc.identifier.isbn978-1-5386-0930-9
dc.identifier.startpage571en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/34849
dc.identifier.wosWOS:000426856900106en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartof2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectsearch space limitationen_US
dc.subjecttree-seed algorithmen_US
dc.subjectboundary conditionsen_US
dc.subjectevolutionary computationen_US
dc.titleBoundary Conditions in Tree-Seed Algorithm Analysis of the success of search space limitation techniques in Tree-Seed Algorithmen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu