Soft Computing

, Volume 23, Issue 23, pp 12347–12362 | Cite as

Multi-objective uncapacitated facility location problem with customers’ preferences: Pareto-based and weighted sum GA-based approaches

  • Soumen Atta
  • Priya Ranjan Sinha Mahapatra
  • Anirban MukhopadhyayEmail author
Methodologies and Application


The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem having single-objective function. The objective of UFLP is to find a subset of facilities from a given set of potential facility locations such that the sum of the opening costs of the opened facilities and the service cost to serve all the customers is minimized. In traditional UFLP, customers are served by their nearest facilities. In this article, we have proposed a multi-objective UFLP where each customer has a preference for each facility. Hence, the objective of the multi-objective UFLP with customers’ preferences (MOUFLPCP) is to open a subset of facilities to serve all the customers such that the sum of the opening cost and service cost is minimized and the sum of the preferences is maximized. In this article, the elitist non-dominated sorting genetic algorithm II (NSGA-II), a popular Pareto-based GA, is employed to solve this problem. Moreover, a weighted sum genetic algorithm (WSGA)-based approach is proposed to solve MOUFLPCP where conflicting two objectives of the problem are aggregated to a single quality measure. For experimental purposes, new test instances of MOUFLPCP are created from the existing UFLP benchmark instances and the experimental results obtained using NSGA-II and WSGA-based approaches are demonstrated and compared for these newly created test instances.


Uncapacitated facility location problem (UFLP) Multi-objective UFLP with customers’ preferences (MOUFLPCP) NSGA-II Weighted sum genetic algorithm (WSGA) 


Compliance with ethical standards

Conflict of interest

This section is to certify that we have no potential conflict of interest.


  1. Aardal K, Labbé M, Leung J, Queyranne M (1996) On the two-level uncapacitated facility location problem. INFORMS J Comput 8(3):289–301zbMATHCrossRefGoogle Scholar
  2. Aardal K, Chudak FA, Shmoys DB (1999) A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inf Process Lett 72(5–6):161–167MathSciNetzbMATHCrossRefGoogle Scholar
  3. Akinc U, Khumawala BM (1977) An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag Sci 23(6):585–594MathSciNetzbMATHCrossRefGoogle Scholar
  4. Al\_Janabi S (2018) Smart system to create an optimal higher education environment using IDA and IOTs. Int J Comput Appl 1–16.
  5. Al\_Janabi S, Al\_Shourbaji I, Salman MA (2018) Assessing the suitability of soft computing approaches for forest fires prediction. Appl Comput Inform 14(2):214–224CrossRefGoogle Scholar
  6. Al-Janabi S (2017) Pragmatic miner to risk analysis for intrusion detection (PMRA-ID). In: International conference on soft computing in data science. Springer, Berlin, pp 263–277Google Scholar
  7. Al-Janabi S, Rawat S, Patel A, Al-Shourbaji I (2015) Design and evaluation of a hybrid system for detection and prediction of faults in electrical transformers. Int J Electr Power Energy Syst 67:324–335CrossRefGoogle Scholar
  8. Al-Sultan K, Al-Fawzan M (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86:91–103MathSciNetzbMATHCrossRefGoogle Scholar
  9. Ardjmand E, Amin-Naseri MR (2012) Unconscious search-a new structured search algorithm for solving continuous engineering optimization problems based on the theory of psychoanalysis. In: Advances in swarm intelligence. Springer, Berlin, pp 233–242Google Scholar
  10. Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396–415MathSciNetzbMATHCrossRefGoogle Scholar
  11. Arqub OA, Mohammed AS, Momani S, Hayat T (2016) Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Soft Comput 20(8):3283–3302zbMATHCrossRefGoogle Scholar
  12. Arqub OA, Al-Smadi M, Momani S, Hayat T (2017) Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems. Soft Comput 21(23):7191–7206zbMATHCrossRefGoogle Scholar
  13. Atta S, Mahapatra PRS (2013) Genetic algorithm based approach for serving maximum number of customers using limited resources. Procedia Technol 10:492–497CrossRefGoogle Scholar
  14. Atta S, Mahapatra PRS (2015) Multi-objective k-center sum clustering problem. In: Emerging ICT for bridging the future-proceedings of the 49th annual convention of the Computer Society of India (CSI), vol 1. Springer, Berlin, pp 417–425Google Scholar
  15. Atta S, Mahapatra PRS, Mukhopadhyay A (2018a) Deterministic and randomized heuristic algorithms for uncapacitated facility location problem. In: Satapathy S, Tavares J, Bhateja V, Mohanty J (eds) Information and decision sciences. Springer, Singapore, pp 205–216CrossRefGoogle Scholar
  16. Atta S, Mahapatra PRS, Mukhopadhyay A (2018b) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22(12):3891–3906CrossRefGoogle Scholar
  17. Atta S, Mahapatra PRS, Mukhopadhyay A (2018c) Solving tool indexing problem using harmony search algorithm with harmony refinement. Soft Comput 1–17.
  18. Atta S, Mahapatra PRS, Mukhopadhyay A (2018d) Solving uncapacitated facility location problem using monkey algorithm. In: Bhateja V, Coello Coello C, Satapathy S, Pattnaik P (eds) Intelligent engineering informatics. Springer, Singapore, pp 71–78CrossRefGoogle Scholar
  19. Balinski M (1964) On finding integer solutions to linear programs. Technical report, DTIC DocumentGoogle Scholar
  20. Bandyopadhyay S, Maulik U, Mukhopadhyay A (2007) Multiobjective genetic clustering for pixel classification in remote sensing imagery. IEEE Trans Geosci Remote Sens 45(5):1506–1511CrossRefGoogle Scholar
  21. Barros AI, Labbé M (1993) The multi-level uncapacitated facility location problem is not submodular. Eur J Oper Res 71(1):130–132zbMATHCrossRefGoogle Scholar
  22. Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 14:1069–1072CrossRefGoogle Scholar
  23. Beasley JE (1993) Lagrangean heuristics for location problems. Eur J Oper Res 65(3):383–399zbMATHCrossRefGoogle Scholar
  24. Bhattacharya R, Bandyopadhyay S (2010) Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm. Int J Adv Manuf Technol 51(1–4):397–414CrossRefGoogle Scholar
  25. Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann Discrete Math 1:79–97MathSciNetzbMATHCrossRefGoogle Scholar
  26. Biswas U, Maulik U, Mukhopadhyay A, Naskar MK (2009) Multiobjective evolutionary approach to cost-effective traffic grooming in unidirectional SONET/WDM rings. Photonic Netw Commun 18(1):105–115CrossRefGoogle Scholar
  27. Coello CC (2006) Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput Intell Mag 1(1):28–36MathSciNetCrossRefGoogle Scholar
  28. Cornuéjols G, Nemhauser GL, Wolsey LA (1983) The uncapacitated facility location problem. Technical report, Management Sciences Research Group, Carnegie-Mellon University, Pittsburgh, PAGoogle Scholar
  29. Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, New YorkzbMATHGoogle Scholar
  30. Deb K (2014) Multi-objective optimization. In: Burke E, Kendall G (eds) Search methodologies. Springer, Boston, pp 403–449CrossRefGoogle Scholar
  31. Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: International conference on parallel problem solving from nature. Springer, Berlin, pp 849–858Google Scholar
  32. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  33. Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, BerlinzbMATHGoogle Scholar
  34. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6):992–1009MathSciNetzbMATHCrossRefGoogle Scholar
  35. Garey MR, Johnson DS (1979) Computers and intractability: a guide to NP-completeness. WH Freeman and Company, New YorkzbMATHGoogle Scholar
  36. Gendron B, Khuong PV, Semet F (2016) A Lagrangian-based branch-and-bound algorithm for the two-level uncapacitated facility location problem with single-assignment constraints. Transp Sci 50(4):1286–1299CrossRefGoogle Scholar
  37. Gendron B, Khuong PV, Semet F (2017) Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints. Comput Oper Res 86:86–93MathSciNetzbMATHCrossRefGoogle Scholar
  38. Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res 150(1):150–162MathSciNetzbMATHCrossRefGoogle Scholar
  39. Goldberg DE (1989) Genetic algorithms in search, optimization & machine learning. Addison-Wesley Longman Publishing, BostonzbMATHGoogle Scholar
  40. Goldberg DE (2006) Genetic algorithms. Pearson Education India, New DelhiGoogle Scholar
  41. Harris I, Mumford C, Naim M (2009) The multi-objective uncapacitated facility location problem for green logistics. In: IEEE congress on evolutionary computation, 2009. CEC’09. IEEE, pp 2732–2739Google Scholar
  42. Jakob W, Blume C (2014) Pareto optimization or cascaded weighted sum: a comparison of concepts. Algorithms 7(1):166–185MathSciNetzbMATHCrossRefGoogle Scholar
  43. Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location problem. Manag Sci 18(12):B-718MathSciNetCrossRefGoogle Scholar
  44. Klose A (1999) An LP-based heuristic for two-stage capacitated facility location problems. J Oper Res Soc 50(2):157–166zbMATHCrossRefGoogle Scholar
  45. Klose A (2000) A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. Eur J Oper Res 126(2):408–421MathSciNetzbMATHCrossRefGoogle Scholar
  46. Kochetov YA, Goncharov EN (2001) Probabilistic tabu search algorithm for the multi-stage uncapacitated facility location problem. In: Operations research proceedings. Springer, Berlin, pp 65–70Google Scholar
  47. Krarup J, Pruzan PM (1983) The simple plant location problem: survey and synthesis. Eur J Oper Res 12(1):36–81MathSciNetzbMATHCrossRefGoogle Scholar
  48. Kratica J, Tošic D, Filipović V, Ljubić I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO Oper Res 35(01):127–142MathSciNetzbMATHCrossRefGoogle Scholar
  49. Kratica J, Dugošija D, Savić A (2014) A new mixed integer linear programming model for the multi level uncapacitated facility location problem. Appl Math Model 38(7–8):2118–2129MathSciNetzbMATHCrossRefGoogle Scholar
  50. Krishnaswamy R, Sviridenko M (2016) Inapproximability of the multilevel uncapacitated facility location problem. ACM Trans Algorithms (TALG) 13(1):1MathSciNetzbMATHCrossRefGoogle Scholar
  51. Lazic N, Frey BJ, Aarabi P (2010) Solving the uncapacitated facility location problem using message passing algorithms. In: International conference on artificial intelligence and statistics, pp 429–436Google Scholar
  52. Lenstra J, Kan AR (1979) Complexity of packing, covering and partitioning problems. Econometric Institute, RotterdamzbMATHGoogle Scholar
  53. Leung J, Aardal K, Labbe M, Queyranne M (1994) The two-level uncapacitated facility location problem. Technical report, University of Michigan, Ann Arbor, MIGoogle Scholar
  54. Monabbati E (2014) An application of a Lagrangian-type relaxation for the uncapacitated facility location problem. Jpn J Ind Appl Math 31(3):483–499MathSciNetzbMATHCrossRefGoogle Scholar
  55. Mukhopadhyay A, Maulik U (2009) Unsupervised pixel classification in satellite imagery using multiobjective fuzzy clustering combined with SVM classifier. IEEE Trans Geosci Remote Sens 47(4):1132–1138CrossRefGoogle Scholar
  56. Mukhopadhyay A, Maulik U, Bandyopadhyay S (2015) A survey of multiobjective evolutionary clustering. ACM Comput Surv (CSUR) 47(4):61CrossRefGoogle Scholar
  57. Patel A, Al-Janabi S, AlShourbaji I, Pedersen J (2015) A novel methodology towards a trusted environment in mashup web applications. Comput Secur 49:107–122CrossRefGoogle Scholar
  58. Rabbani M, Farrokhi-Asl H, Asgarian B (2017) Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem. J Ind Eng Int 13(1):13–27CrossRefGoogle Scholar
  59. Rahmati SHA, Zandieh M, Yazdani M (2013) Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol 64:1–18CrossRefGoogle Scholar
  60. Ripon KSN, Glette K, Mirmotahari O, Høvin M, Tørresen J (2009) Pareto optimal based evolutionary approach for solving multi-objective facility layout problem. In: International conference on neural information processing. Springer, Berlin, pp 159–168Google Scholar
  61. Roudenko O, Schoenauer M (2004) A steady performance stopping criterion for Pareto-based evolutionary algorithms. In: The 6th international multi-objective programming and goal programming conferenceGoogle Scholar
  62. Şahin G, Süral H (2007) A review of hierarchical facility location models. Comput Oper Res 34(8):2310–2331MathSciNetzbMATHCrossRefGoogle Scholar
  63. Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17–26CrossRefGoogle Scholar
  64. Sun M (2006) Solving the uncapacitated facility location problem using tabu search. Comput Oper Res 33(9):2563–2589MathSciNetzbMATHCrossRefGoogle Scholar
  65. Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proceedings of the 3rd international conference on genetic algorithmsGoogle Scholar
  66. Tcha DW, Bi Lee (1984) A branch-and-bound algorithm for the multi-level uncapacitated facility location problem. Eur J Oper Res 18(1):35–43zbMATHCrossRefGoogle Scholar
  67. Zhang J (2006) Approximating the two-level facility location problem via a quasi-greedy approach. Math Program 108(1):159–176MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

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

Personalised recommendations