A Comprehensive Comparison of Binary Archimedes Optimization Algorithms on Uncapacitated Facility Location Problems

Basit Öğe Kaydı
dc.contributor.authorÇınar, Ahmet Cevahir
dc.date.accessioned2023-04-10T20:29:28Z
dc.date.available2023-04-10T20:29:28Z
dc.date.issued2022
dc.departmentRektörlük, Rektörlüğe Bağlı Birimler, Düzce Üniversitesi Dergilerien_US
dc.description.abstractMetaheuristic optimization algorithms are widely used in solving NP-hard continuous optimization problems. Whereas, in the real world, many optimization problems are discrete. The uncapacitated facility location problem (UFLP) is a pure discrete binary optimization problem. Archimedes optimization algorithm (AOA) is a recently develop metaheuristic optimization algorithm and there is no binary variant of AOA. In this work, 17 transfer functions (TF1-TF17) are used for mapping continuous values to binary values. 17 binary variants of AOA (BAOA1- BAOA17) are proposed for solving UFLPs. 16 to 100-dimensional UFLPs were solved with binary variants of AOA. Stationary and non-stationary transfer functions were compared in terms of solution quality. The non-stationary transfer functions were produced better solutions than stationary transfer functions. Peculiar parameter analyzes for binary optimization problems were performed in the best variant (BAOA9) produced with TF9 transfer function.en_US
dc.identifier.doi10.29130/dubited.876284
dc.identifier.endpage38en_US
dc.identifier.issn2148-2446
dc.identifier.issue1en_US
dc.identifier.startpage27en_US
dc.identifier.trdizinid1123378en_US
dc.identifier.urihttp://doi.org/10.29130/dubited.876284
dc.identifier.urihttps://search.trdizin.gov.tr/yayin/detay/1123378
dc.identifier.urihttps://hdl.handle.net/20.500.12684/11873
dc.identifier.volume10en_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.relation.ispartofDüzce Üniversitesi Bilim ve Teknoloji Dergisien_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBinary optimizationen_US
dc.subjectUncapacitated facility location problemen_US
dc.subjectArchimedes optimization algorithm İkili optimizasyonen_US
dc.subjectKapasitesiz tesis yerleşimi problemien_US
dc.subjectArşimet optimizasyon algoritmasıen_US
dc.titleA Comprehensive Comparison of Binary Archimedes Optimization Algorithms on Uncapacitated Facility Location Problemsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
11873.pdf
Boyut:
559.67 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

TR-Dizin İndeksli Yayınlar Koleksiyonu
Düzce Üniversitesi Bilim ve Teknoloji Dergisi Koleksiyonu