Optimizing Uncapacitated Facility Location Problem with Cuckoo Search Algorithm based on Gauss Distribution

Mohammad Agung Nugroho, Eto Wuryanto, Kartono Faqih

Abstract


The objective of this study was to assess the capability of the Gauss distribution-based Cuckoo Search algorithm (GCS) in solving the Uncapacitated Facility Location Problem (UFLP). UFLP is an optimization problem that there are number of locations available to be built a facility so that it can serve number of customers, assuming each facility has no limits to serve customers and only a single facility is allowed to provide services to each customer. The objective function of UFLP is to minimize the combined costs of constructing facilities in an area and providing services to customers. UFLP falls under the category of NP-Hard Problems, where the computation complexity increases with the size of the data. The Cuckoo Search algorithm, which mimics the breeding behavior of Cuckoo birds, has been extensively used to tackle optimization problems. GCS was introduced to overcome the weaknesses of Cuckoo Search algorithm in terms of computational time and search accuracy. GCS used Gaussian distribution instead of Levy Flight which based on Levy distribution. In this study, the GCS algorithm was implemented using JavaScript and the dataset used was obtained from ORLib. The research outcomes showed that the GCS algorithm could achieve optimal result in all dataset.

Full Text:

PDF

References


S. Madavi and P. B. Sangode, “Exploring the Influence of Facility Location on the Operations of Service Organizations,” IOSR J. Eng., vol. 9, no. 5, pp. 45–52, 2019.

L. A. W. Cornuejols, Gerard ; George L. Nemhauser, “The Uncapicitated Facility Location Problem.” 1984.

A. R. Guner and M. Sevkli, “A Discrete Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem,” J. Artif. Evol. Appl., vol. 2008, pp. 1–9, Apr. 2008.

E. Baş and E. Ülker, “A binary social spider algorithm for uncapacitated facility location problem,” Expert Syst. Appl., vol. 161, 2020.

H. Hakli and Z. Ortacay, “An improved scatter search algorithm for the uncapacitated facility location problem,” Comput. Ind. Eng., vol. 135, no. June, pp. 855–867, 2019.

E. Sonuç, “Binary crow search algorithm for the uncapacitated facility location problem,” Neural Comput. Appl., vol. 33, no. 21, pp. 14669–14685, 2021.

S. Atta, P. R. S. Mahapatra, and A. Mukhopadhyay, Solving uncapacitated facility location problem using monkey algorithm, vol. 695. Springer Singapore, 2018.

E. M. Fitzpatrick-Wacker, “Cuckoo Brood Parasitism,” in Encyclopedia of Animal Cognition and Behavior, no. Langmore 2013, Cham: Springer International Publishing, 2020, pp. 1–5.

X.-S. Yang and Suash Deb, “Cuckoo Search via Lévy flights,” in 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 2009, pp. 210–214.

H. Zheng and Y. Zhou, “A novel Cuckoo Search optimization algorithm base on gauss distribution,” J. Comput. Inf. Syst., vol. 8, no. 10, pp. 4193–4200, 2012.

O. Kr, Avian Brood Parasitism, no. July. Cham: Springer International Publishing, 2017.

X.-S. S. Yang and M. Karamanoglu, Nature-Inspired Metaheuristic Algorithms Second Edition, Second Edi. Frome: Luniver Press, 2010.

I. Fister, X.-S. Yang, D. Fister, and I. Fister, “Cuckoo Search: A Brief Literature Review,” in Studies in Computational Intelligence, vol. 516, 2014, pp. 49–62.

X. S. Yang and S. Deb, “Engineering optimisation by cuckoo search,” Int. J. Math. Model. Numer. Optim., vol. 1, no. 4, pp. 330–343, 2010.

J. E. Beasley, “Or-library: Distributing test problems by electronic mail,” J. Oper. Res. Soc., vol. 41, no. 11, pp. 1069–1072, 1990.

J. E. Beasley, “No Title,” 1990. [Online]. Available: http://people.brunel.ac.uk/~mastjjb/jeb/info.html.

Y. Lin, C. Zhang, and Z. Liang, “Cuckoo Search Algorithm with Hybrid Factor Using Dimensional Distance,” Math. Probl. Eng., vol. 2016, pp. 1–11, 2016.

Q. Pan, C. Darabos, and J. H. Moore, Cuckoo Search and Firefly Algorithm, vol. 516. Cham: Springer International Publishing, 2014.




DOI: https://doi.org/10.32520/stmsi.v12i2.2467

Article Metrics

Abstract view : 231 times
PDF - 92 times

Refbacks



Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
https://learning.modernland.co.id/api/toto/http://himatikauny.org/wp-includes/mahjong-ways-3/https://www.jst.hvu.edu.vn/akun-pro-kamboja/https://section.iaesonline.com/akun-pro-kamboja/https://journals.uol.edu.pk/sugar-rush/http://mysimpeg.gowakab.go.id/mysimpeg/aset/https://jurnal.jsa.ikippgriptk.ac.id/plugins/https://ppid.cimahikota.go.id/assets/demo/https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/