A Comprehensive Comparison of Binary Archimedes Optimization Algorithms on Uncapacitated Facility Location Problems
Yükleniyor...
Dosyalar
Tarih
2022
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Metaheuristic 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.
Açıklama
Anahtar Kelimeler
Binary optimization, Uncapacitated facility location problem, Archimedes optimization algorithm İkili optimizasyon, Kapasitesiz tesis yerleşimi problemi, Arşimet optimizasyon algoritması
Kaynak
Düzce Üniversitesi Bilim ve Teknoloji Dergisi
WoS Q Değeri
Scopus Q Değeri
Cilt
10
Sayı
1
