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

Asri Bekti Pratiwi, Nur Faiza, Edi Edi Winarko


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.


Cuckoo Search Algorithm (CSA), Uncapacitated Facility Location Problem (UFLP).

Full Text:



Kole, A., Chakrabarti, P., dan Bhattacharyya, S., 2014, An Ant Colony Optimization Algorithm for Uncapacitated Facility Location Problem. Artificial Intellegence and Applications, Vol 1, no.1, pp 51-61.

Guner, A.R., dan Sevkli, M., 2008, A Discrete Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem, Journal of Artificial Evolution and Applications, Vol. I, no. 1, pp 1-9.

Tuncbilek, N., Tasgetiren. F., dan Esnaf, S., 2012, Artificial Bee Colony Optimization Algorithm for Uncapacitated Facility Location Problems, Journal of Economic and Social Research, Vol 14(1), 1-24.

Azad, M.A.K., Rocha, A.M.A. C., dan Fernandes, E.M.G P., 2013, A Simplified Binary Artificial Fish Swarm Algorithm for Uncapacitated Facility Location Problems, World Congress on Engineering, Vol I, no. 1, 31-36.

Yang, X.-S., dan Deb, S. 2009. Cuckoo Search via Lévy Flights. In Nature and Biologically Inspired Computing. World Congress on NaBIC (pp. 201-214). IEEE.

Payne, R. B., Sorensen, M. D., dan Klitz,K., 2005, The Cuckoos, Oxford UniversityPress.

Lin, Y., Zhang, C., dan Liang, Z., 2016, Cuckoo Search Algorithm with Hybrid Factor Using Dimensional Distance, Journal of Mathematical Problems in Engineering, Vol. 2016.

Civicioglu, P., Besdok, E., 2013., Comparative Analysis of the Cuckoo Search Algorithm, In: Yang XS.(eds) Cuckoo Search and Firefly Algorithm. Studies in Computational Intelligence,Vol 516, 85-113.

Mantegna, R.N, 1994, Fast, Accurate Algorithm for Numerical Simulation of Levy Stable Stochastic Processes Phys. Rev E 49, 4677-4683.

Diethelm, K., 2004, The Analysis of Fractional Differential Equation, Springer, New York.

Vrajitoru, D., dan Knight, W., 2014, Practical Analysis of Algorithms, Springer, New York.

Lanczos, C., 1964, A Precision Approximation of The Gamma Function, SIAM J Numer Anal, 1: 86-89.

Beasly,J.E.,2005a.OR-Library:, (17 Januari 2019)

Beasly,J.E.,2005a.OR-Library:, (17 Januari 2019)

Kaveh, A., dan Bakhspoori, T., 2013, Optimum Design of Steel Frames Using Cuckoo Search Algorithm with Levy Flights, Struct Des Tall Spec Build, 22: 2013-1036.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.