Advertisement

Solving Uncapacitated Facility Location Problem Using Monkey Algorithm

  • Soumen Atta
  • Priya Ranjan Sinha Mahapatra
  • Anirban Mukhopadhyay
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 695)

Abstract

The Uncapacitated Facility Location Problem (UFLP) is considered in this paper. Given a set of customers and a set of potential facility locations, the objective of UFLP is to open a subset of facilities to satisfy the demands of all the customers such that the sum of the opening cost for the opened facilities and the service cost is minimized. UFLP is a well-known combinatorial optimization problem which is also NP-hard. So, a metaheuristic algorithm for solving this problem is natural choice. In this paper, a relatively new swarm intelligence-based algorithm known as the Monkey Algorithm (MA) is applied to solve UFLP. To validate the efficiency of the proposed binary MA-based algorithm, experiments are carried out with various data instances of UFLP taken from the OR-Library and the results are compared with those of the Firefly Algorithm (FA) and the Artificial Bee Colony (ABC) algorithm.

Keywords

Uncapacitated Facility Location Problem (UFLP) Simple Plant Location Problem (SPLP) Warehouse Location Problem (WLP) Monkey Algorithm 

References

  1. 1.
    Akinc, U., Khumawala, B.M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manage. Sci. 23(6), 585–594 (1977)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Al-Sultan, K., Al-Fawzan, M.: A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. 86, 91–103 (1999)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Ardjmand, E., Park, N., Weckman, G., Amin-Naseri, M.R.: The discrete Unconscious search and its application to uncapacitated facility location problem. Computers & Industrial Engineering 73, 32–40 (2014)CrossRefGoogle Scholar
  4. 4.
    Krarup, J., Pruzan, P.M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12(1), 36–81 (1983)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Kratica, J., Tošic, D., Filipović, V., Ljubić, I.: Solving the simple plant location problem by genetic algorithm. RAIRO-Operations Research 35(01), 127–142 (2001)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to NP-Completeness (1979)Google Scholar
  7. 7.
    Lenstra, J., Kan, A.R.: Complexity of Packing, Covering and Partitioning Problems. Econometric Institute (1979)Google Scholar
  8. 8.
    Bilde, O., Krarup, J.: Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann. Discret. Math. 1, 79–97 (1977)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Van Roy, T.J.: A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1), 145–163 (1986)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 265–274. ACM (1997)Google Scholar
  11. 11.
    Beltran-Royo, C., Vial, J.P., Alonso-Ayuso, A.: Solving the uncapacitated facility location problem with semi-Lagrangian relaxation. Statistics and Operations Research, Rey Juan Carlos University, Mostoles, Madrid, España (2007)Google Scholar
  12. 12.
    Monabbati, E.: An application of a Lagrangian-type relaxation for the uncapacitated facility location problem. Jpn J. Ind. Appl. Math. 31(3), 483–499 (2014)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992–1009 (1978)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Körkel, M.: On the exact solution of large-scale simple plant location problems. Eur. J. Oper. Res. 39(2), 157–173 (1989)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33(9), 2563–2589 (2006)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Guner, A.R., Sevkli, M.: A discrete particle swarm optimization algorithm for uncapacitated facility location problem. J. Artif. Evol. Appl. 2008 (2008)Google Scholar
  17. 17.
    Tuncbilek, N., Tasgetiren, F., Esnaf, S.: Artificial bee colony optimization algorithm for uncapacitated facility location problems. J. Econ. Soc. Res. 14(1), 1 (2012)Google Scholar
  18. 18.
    Watanabe, Y., Takaya, M., Yamamura, A.: Fitness function in ABC algorithm for uncapacitated facility location problem. In: ICT-EurAsia/CONFENIS, pp. 129–138 (2015)CrossRefGoogle Scholar
  19. 19.
    Aydin, M.E., Fogarty, T.C.: A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. J. Heuristics 10(3), 269–292 (2004)CrossRefGoogle Scholar
  20. 20.
    Kole, A., Chakrabarti, P., Bhattacharyya, S.: An ant colony optimization algorithm for uncapacitated facility location problem. Artif. Intell. 1(1) (2014)CrossRefGoogle Scholar
  21. 21.
    Tsuya, K., Takaya, M., Yamamura, A.: Application of the firefly algorithm to the uncapacitated facility location problem. J. Intell. Fuzzy Syst. 32(4), 3201–3208 (2017)CrossRefGoogle Scholar
  22. 22.
    Zhao, R.Q., Tang, W.S.: Monkey algorithm for global numerical optimization. J. Uncertain Syst. 2(3), 165–176 (2008)Google Scholar
  23. 23.
    Zhang, J., Zhang, Y., Sun, J.: Intrusion detection technology based on monkey algorithm. Comput. Eng. 37(14), 131–133 (2011)Google Scholar
  24. 24.
    Yi, T.H., Li, H.N., Zhang, X.D.: A modified monkey algorithm for optimal sensor placement in structural health monitoring. Smart Mater. Struct. 21(10), 105033 (2012)CrossRefGoogle Scholar
  25. 25.
    Mali, Z.T.X.Y.Z.: Optimization of gas filling station project scheduling problem based on monkey algorithm. Value Eng. 8, 058 (2010)Google Scholar
  26. 26.
    Chen, X., Zhou, Y., Luo, Q.: A hybrid monkey search algorithm for clustering analysis. Sci. World J. 2014 (2014)Google Scholar
  27. 27.
    Zhou, Y., Chen, X., Zhou, G.: An improved monkey algorithm for a 0–1 knapsack problem. Appl. Soft Comput. 38, 817–830 (2016)CrossRefGoogle Scholar
  28. 28.
    Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 1069–1072 (1990)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Soumen Atta
    • 1
  • Priya Ranjan Sinha Mahapatra
    • 1
  • Anirban Mukhopadhyay
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of KalyaniNadiaIndia

Personalised recommendations