Araştırma Makalesi

A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems

Cilt: 29 Sayı: 7 30 Aralık 2023
PDF İndir
TR EN

A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems

Abstract

Moth Flame Optimization is a nature-inspired meta-heuristic algorithm for constantly solving real-world problems. In this study, a modified version of MFO called binary Enhanced MFO Desert Bush (binEMFO-DB) algorithm is proposed to solve uncapacitated facility location problems. The proposed algorithm includes three modifications: i) chaotic mapbased population initialization, ii) random flame selection, and iii) desert bush strategy. The performance of the proposed binEMFO-DB algorithm was tested on 15 different UFL problems from the OR-Library and Taguchi orthogonal array design was used for parameter analysis. The average, gap and hit values of the results obtained by the algorithms were used as performance metrics. The performance of binEMFO-DB is compared with the performance of state-of-the-art algorithms. The results show that the proposed binEMFO-DB has a successful and competitive performance in the test environment.

Keywords

Kaynakça

  1. [1] Babalik A, Cinar AC, Kiran MS. "A modification of tree-seed algorithm using Deb’s rules for constrained optimization". Applied Soft Computing, 63, 289-305, 2018.
  2. [2] Yuan X, Nie H, Su A, Wang L, Yuan Y. "An improved binary particle swarm optimization for unit commitment problem". Expert Systems with Applications, 36(4), 8049-8055, 2009.
  3. [3] Van Beers F, Lindström A, Okafor E,Wiering MA. "Deep Neural Networks with Intersection over Union Loss for Binary Image Segmentation". ICPRAM. Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods, Prague, Czech Republic, 19-21 February 2019.
  4. [4] Banitalebi A, Aziz MIA, Aziz ZA. "A self-adaptive binary differential evolution algorithm for large scale binary optimization problems". Information Sciences, 367, 487-511, 2016.
  5. [5] Ayaz HI, Ozturk ZK. "A mathematical model and a heuristic approach for train seat scheduling to minimize dwell time". Computers & Industrial Engineering, 160, 1-7, 2021.
  6. [6] Aslan M, Gunduz M, Kiran MS. "JayaX: Jaya algorithm with xor operator for binary optimization". Applied Soft Computing, 82, 1-17, 2019.
  7. [7] Baş E, Ülker E. "A binary social spider algorithm for uncapacitated facility location problem". Expert Systems with Applications, 161, 1-27, 2020.
  8. [8] Rizk-Allah RM, Hassanien AE, Elhoseny M, Gunasekaran M. "A new binary salp swarm algorithm: development and application for optimization tasks". Neural Computing and Applications, 31(5), 1641-1663, 2019.

Ayrıntılar

Birincil Dil

İngilizce

Konular

Algoritmalar ve Hesaplama Kuramı

Bölüm

Araştırma Makalesi

Yazarlar

Yayımlanma Tarihi

30 Aralık 2023

Gönderilme Tarihi

26 Temmuz 2022

Kabul Tarihi

6 Ocak 2023

Yayımlandığı Sayı

Yıl 2023 Cilt: 29 Sayı: 7

Kaynak Göster

APA
Özkış, A., & Karakoyun, M. (2023). A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, 29(7), 737-751. https://izlik.org/JA37WR43BA
AMA
1.Özkış A, Karakoyun M. A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. 2023;29(7):737-751. https://izlik.org/JA37WR43BA
Chicago
Özkış, Ahmet, ve Murat Karakoyun. 2023. “A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 29 (7): 737-51. https://izlik.org/JA37WR43BA.
EndNote
Özkış A, Karakoyun M (01 Aralık 2023) A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 29 7 737–751.
IEEE
[1]A. Özkış ve M. Karakoyun, “A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems”, Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, c. 29, sy 7, ss. 737–751, Ara. 2023, [çevrimiçi]. Erişim adresi: https://izlik.org/JA37WR43BA
ISNAD
Özkış, Ahmet - Karakoyun, Murat. “A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 29/7 (01 Aralık 2023): 737-751. https://izlik.org/JA37WR43BA.
JAMA
1.Özkış A, Karakoyun M. A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. 2023;29:737–751.
MLA
Özkış, Ahmet, ve Murat Karakoyun. “A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, c. 29, sy 7, Aralık 2023, ss. 737-51, https://izlik.org/JA37WR43BA.
Vancouver
1.Ahmet Özkış, Murat Karakoyun. A binary enhanced moth flame optimization algorithm for uncapacitated facility location problems. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi [Internet]. 01 Aralık 2023;29(7):737-51. Erişim adresi: https://izlik.org/JA37WR43BA