Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Contemporary Mathematics and Applications (ConMathA)
Nur Faiza
Universitas Airlangga
Materials Science & Nanotechnology Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
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) Vol. 1 No. 1 (2019)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (355.693 KB) | DOI: 10.20473/conmatha.v1i1.14773

Abstract

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.
Co-Authors Asri Bekti Pratiwi, Asri Bekti Edi Winarko