A binary tree seed algorithm with selection-based local search mechanism for huge-sized optimization problems

Basit Öğe Kaydı
dc.contributor.authorKarakoyun, Murat
dc.contributor.authorOzkis, Ahmet
dc.date.accessioned2024-02-23T14:02:11Z
dc.date.available2024-02-23T14:02:11Z
dc.date.issued2022
dc.departmentNEÜen_US
dc.description.abstractTree seed algorithm (TSA) is a recently proposed metaheuristic algorithm for solving continuous optimization problems. In order to use TSA in binary optimization problems, the SimLogicTSA method was developed by adding logic gates and Jaccard's similarity measure to this algorithm by Cinar and Kiran. Although SimLogicTSA is generally successful in small, medium, and large size problems, it has not been successful in the huge-sized problems by stucking into local minima. To overcome this problem, a new local search mechanism called enhanced local search module (ELSM) is proposed and the SimLogicTSA-ELSM algorithm is suggested by implementing the ELSM mechanism to the original SimLogicTSA algorithm. The proposed ELSM mechanism consists of a swap operator and logic-based gates. To analyze the contribution of the ELSM mechanism to the algorithm, firstly, the original SimLogicTSA and SimLogicTSA-ELSM algorithms were compared on the Cap and M* problem sets. The obtained results showed that the proposed algorithm produced more successful results than the original SimLogicTSA. Then, the proposed SimLogicTSA-ELSM is compared with many state-of -art algorithms in the literature by using different performance metrics on Cap and M* problem sets. The results show that SimLogicTSA-ELSM outperforms the compared algorithms in nearly all cases. Especially, the performance of the SimLogicTSA-ELSM stands out in huge-sized problems. (C) 2022 Elsevier B.V. All rights reserved.en_US
dc.identifier.doi10.1016/j.asoc.2022.109590
dc.identifier.issn1568-4946
dc.identifier.issn1872-9681
dc.identifier.scopus2-s2.0-85138031729en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2022.109590
dc.identifier.urihttps://hdl.handle.net/20.500.12452/11622
dc.identifier.volume129en_US
dc.identifier.wosWOS:000865440900003en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofApplied Soft Computingen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTree Seed Algorithmen_US
dc.subjectBinary Optimizationen_US
dc.subjectUncapacitated Facility Location Problemen_US
dc.subjectLocal Search Mechanismen_US
dc.titleA binary tree seed algorithm with selection-based local search mechanism for huge-sized optimization problemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu