Çınar, Ahmet Cevahir2023-04-102023-04-1020222148-2446http://doi.org/10.29130/dubited.876284https://search.trdizin.gov.tr/yayin/detay/1123378https://hdl.handle.net/20.500.12684/11873Metaheuristic 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.en10.29130/dubited.876284info:eu-repo/semantics/openAccessBinary optimizationUncapacitated facility location problemArchimedes optimization algorithm İkili optimizasyonKapasitesiz tesis yerleşimi problemiArşimet optimizasyon algoritmasıArticle10127381123378