EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

Penerapan Cuckoo Search Algorithm (CSA) untuk Menyelesaikan Uncapacitated Facility Location Problem (UFLP)

Asri Bekti Pratiwi, Nur Faiza, Edi Edi Winarko

Contemporary Mathematics and Applications (ConMathA) · 2019

DOI: 10.20473/conmatha.v1i1.14773 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Contemporary Mathematics and Applications (ConMathA), 2019. Verfasst von Asri Bekti Pratiwi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The aim of this research is to solve Uncapacitated Facility Location Problem (UFLP) using Cuckoo Search Algorithm (CSA). UFLP involves n locations and facilities to minimize the sum of the fixed setup costs and serving costs of m customers. In this problem, it is assumed that the built facilities have no limitations in serving customers, all request from each customers only require on facility, and one location only provides one facility. The purpose of the UFLP is to minimize the total cost of building facilities and customer service costs. CSA is an algorithm inspired by the parasitic nature of some cuckoo species that lay their eggs in other host birds nests. The Cuckoo Search Algorithm (CSA) application program for resolving Uncapacitated Facility Location Problems (UFLP) was made by using Borland C ++ programming language implemented in two sample cases namely small data and big data. Small data contains 10 locations and 15 customers, while big data consists 50 locations and 50 customers. From the computational results, it was found that higher number of nests and iterations lead to minimum total costs. Smaller value of pa brought to better solution of UFLP.

Zitieren

APA

Pratiwi, A. B., Faiza, N., & Winarko, E. E. (2019). Penerapan Cuckoo Search Algorithm (CSA) untuk Menyelesaikan Uncapacitated Facility Location Problem (UFLP). Contemporary Mathematics and Applications (ConMathA). https://doi.org/10.20473/conmatha.v1i1.14773

Vancouver

Pratiwi AB, Faiza N, Winarko EE. Penerapan Cuckoo Search Algorithm (CSA) untuk Menyelesaikan Uncapacitated Facility Location Problem (UFLP). Contemporary Mathematics and Applications (ConMathA). 2019. doi:10.20473/conmatha.v1i1.14773

BibTeX
@article{Pratiwi2019,
  author = {Pratiwi, Asri Bekti and Faiza, Nur and Winarko, Edi Edi},
  title = {Penerapan Cuckoo Search Algorithm (CSA) untuk Menyelesaikan Uncapacitated Facility Location Problem (UFLP)},
  journal = {Contemporary Mathematics and Applications (ConMathA)},
  year = {2019},
  doi = {10.20473/conmatha.v1i1.14773}
}
Kostenlos starten →