TESTING of TREE-SEED ALGORITHM on P-MEDIAN BENCHMARK PROBLEMS

Basit Öğe Kaydı
dc.contributor.authorEli?Güzel, İbrahim Miraç
dc.contributor.authorÖzceylan, Eren
dc.contributor.authorÇeti?Nkaya, Cihan
dc.date.accessioned2025-01-06T17:30:37Z
dc.date.available2025-01-06T17:30:37Z
dc.date.issued2019
dc.description.abstractThis paper presents an application of tree-seed algorithm (TSA) -which is based on the relation between trees and their seeds- on the P-median benchmark problems. To the best knowledge of the authors, this is the first study which applies TSA to the P-median problem. In this paper, different P-median problem instances are generated to show the applicability of the TSA. The experimental results are compared with the optimal results obtained by GAMS-CPLEX. Also, TSA is applied on data sets from OR-Library, and then the obtained and known optimal results are compared. The comparisons demonstrate that the TSA can find optimal and near-optimal values for the small and medium-sized problems, respectively. © 2019 Yildiz Technical University. All Rights Reserved.
dc.identifier.endpage1434
dc.identifier.issn1304-7191
dc.identifier.issue4
dc.identifier.scopus2-s2.0-85122854851
dc.identifier.scopusqualityQ3
dc.identifier.startpage1421
dc.identifier.urihttps://hdl.handle.net/20.500.14669/1680
dc.identifier.volume37
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherYildiz Technical University
dc.relation.ispartofSigma Journal of Engineering and Natural Sciences
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_20241211
dc.subjectLocation and allocation
dc.subjectmeta-heuristic
dc.subjectP-median problem
dc.subjecttree-seed algorithm
dc.titleTESTING of TREE-SEED ALGORITHM on P-MEDIAN BENCHMARK PROBLEMS
dc.typeArticle

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu