{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:43:31Z","timestamp":1784241811955,"version":"3.55.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T00:00:00Z","timestamp":1548115200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00500-019-03774-1","type":"journal-article","created":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T18:41:47Z","timestamp":1548268907000},"page":"12347-12362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Multi-objective uncapacitated facility location problem with customers\u2019 preferences: Pareto-based and weighted sum GA-based approaches"],"prefix":"10.1007","volume":"23","author":[{"given":"Soumen","family":"Atta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Priya Ranjan","family":"Sinha Mahapatra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anirban","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,22]]},"reference":[{"issue":"3","key":"3774_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1287\/ijoc.8.3.289","volume":"8","author":"K Aardal","year":"1996","unstructured":"Aardal K, Labb\u00e9 M, Leung J, Queyranne M (1996) On the two-level uncapacitated facility location problem. INFORMS J Comput 8(3):289\u2013301","journal-title":"INFORMS J Comput"},{"issue":"5\u20136","key":"3774_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K Aardal","year":"1999","unstructured":"Aardal K, Chudak FA, Shmoys DB (1999) A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inf Process Lett 72(5\u20136):161\u2013167","journal-title":"Inf Process Lett"},{"issue":"6","key":"3774_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1287\/mnsc.23.6.585","volume":"23","author":"U Akinc","year":"1977","unstructured":"Akinc U, Khumawala BM (1977) An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag Sci 23(6):585\u2013594","journal-title":"Manag Sci"},{"key":"3774_CR4","doi-asserted-by":"publisher","unstructured":"Al\\_Janabi S (2018) Smart system to create an optimal higher education environment using IDA and IOTs. Int J Comput Appl 1\u201316. \n                    https:\/\/doi.org\/10.1080\/1206212X.2018.1512460","DOI":"10.1080\/1206212X.2018.1512460"},{"issue":"2","key":"3774_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.aci.2017.09.006","volume":"14","author":"S Al\\_Janabi","year":"2018","unstructured":"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\u2013224","journal-title":"Appl Comput Inform"},{"key":"3774_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013277","DOI":"10.1007\/978-981-10-7242-0_23"},{"key":"3774_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.ijepes.2014.12.005","volume":"67","author":"S Al-Janabi","year":"2015","unstructured":"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\u2013335","journal-title":"Int J Electr Power Energy Syst"},{"key":"3774_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1018956213524","volume":"86","author":"K Al-Sultan","year":"1999","unstructured":"Al-Sultan K, Al-Fawzan M (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86:91\u2013103","journal-title":"Ann Oper Res"},{"key":"3774_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013242","DOI":"10.1007\/978-3-642-30976-2_28"},{"key":"3774_CR10","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ins.2014.03.128","volume":"279","author":"OA Arqub","year":"2014","unstructured":"Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396\u2013415","journal-title":"Inf Sci"},{"issue":"8","key":"3774_CR11","doi-asserted-by":"publisher","first-page":"3283","DOI":"10.1007\/s00500-015-1707-4","volume":"20","author":"OA Arqub","year":"2016","unstructured":"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\u20133302","journal-title":"Soft Comput"},{"issue":"23","key":"3774_CR12","doi-asserted-by":"publisher","first-page":"7191","DOI":"10.1007\/s00500-016-2262-3","volume":"21","author":"OA Arqub","year":"2017","unstructured":"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\u20137206","journal-title":"Soft Comput"},{"key":"3774_CR13","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.protcy.2013.12.387","volume":"10","author":"S Atta","year":"2013","unstructured":"Atta S, Mahapatra PRS (2013) Genetic algorithm based approach for serving maximum number of customers using limited resources. Procedia Technol 10:492\u2013497","journal-title":"Procedia Technol"},{"key":"3774_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013425","DOI":"10.1007\/978-3-319-13728-5_47"},{"key":"3774_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-981-10-7563-6_22","volume-title":"Information and decision sciences","author":"S Atta","year":"2018","unstructured":"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\u2013216"},{"issue":"12","key":"3774_CR16","doi-asserted-by":"publisher","first-page":"3891","DOI":"10.1007\/s00500-017-2598-3","volume":"22","author":"S Atta","year":"2018","unstructured":"Atta S, Mahapatra PRS, Mukhopadhyay A (2018b) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22(12):3891\u20133906","journal-title":"Soft Comput"},{"key":"3774_CR17","doi-asserted-by":"publisher","unstructured":"Atta S, Mahapatra PRS, Mukhopadhyay A (2018c) Solving tool indexing problem using harmony search algorithm with harmony refinement. Soft Comput 1\u201317. \n                    https:\/\/doi.org\/10.1007\/s00500-018-3385-5","DOI":"10.1007\/s00500-018-3385-5"},{"key":"3774_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-981-10-7566-7_8","volume-title":"Intelligent engineering informatics","author":"S Atta","year":"2018","unstructured":"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\u201378"},{"key":"3774_CR19","unstructured":"Balinski M (1964) On finding integer solutions to linear programs. Technical report, DTIC Document"},{"issue":"5","key":"3774_CR20","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1109\/TGRS.2007.892604","volume":"45","author":"S Bandyopadhyay","year":"2007","unstructured":"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\u20131511","journal-title":"IEEE Trans Geosci Remote Sens"},{"issue":"1","key":"3774_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0377-2217(93)90266-P","volume":"71","author":"AI Barros","year":"1993","unstructured":"Barros AI, Labb\u00e9 M (1993) The multi-level uncapacitated facility location problem is not submodular. Eur J Oper Res 71(1):130\u2013132","journal-title":"Eur J Oper Res"},{"key":"3774_CR22","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"14","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 14:1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"3","key":"3774_CR23","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley JE (1993) Lagrangean heuristics for location problems. Eur J Oper Res 65(3):383\u2013399","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"3774_CR24","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00170-010-2622-6","volume":"51","author":"R Bhattacharya","year":"2010","unstructured":"Bhattacharya R, Bandyopadhyay S (2010) Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm. Int J Adv Manuf Technol 51(1\u20134):397\u2013414","journal-title":"Int J Adv Manuf Technol"},{"key":"3774_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume":"1","author":"O Bilde","year":"1977","unstructured":"Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann Discrete Math 1:79\u201397","journal-title":"Ann Discrete Math"},{"issue":"1","key":"3774_CR26","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s11107-008-0174-6","volume":"18","author":"U Biswas","year":"2009","unstructured":"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\u2013115","journal-title":"Photonic Netw Commun"},{"issue":"1","key":"3774_CR27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.1597059","volume":"1","author":"CC Coello","year":"2006","unstructured":"Coello CC (2006) Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput Intell Mag 1(1):28\u201336","journal-title":"IEEE Comput Intell Mag"},{"key":"3774_CR28","unstructured":"Cornu\u00e9jols G, Nemhauser GL, Wolsey LA (1983) The uncapacitated facility location problem. Technical report, Management Sciences Research Group, Carnegie-Mellon University, Pittsburgh, PA"},{"key":"3774_CR29","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, New York"},{"key":"3774_CR30","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-1-4614-6940-7_15","volume-title":"Search methodologies","author":"K Deb","year":"2014","unstructured":"Deb K (2014) Multi-objective optimization. In: Burke E, Kendall G (eds) Search methodologies. Springer, Boston, pp 403\u2013449"},{"key":"3774_CR31","doi-asserted-by":"crossref","unstructured":"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\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"2","key":"3774_CR32","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"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\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"3774_CR33","volume-title":"Facility location: applications and theory","author":"Z Drezner","year":"2001","unstructured":"Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Berlin"},{"issue":"6","key":"3774_CR34","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6):992\u20131009","journal-title":"Oper Res"},{"key":"3774_CR35","volume-title":"Computers and intractability: a guide to NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to NP-completeness. WH Freeman and Company, New York"},{"issue":"4","key":"3774_CR36","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1287\/trsc.2016.0692","volume":"50","author":"B Gendron","year":"2016","unstructured":"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\u20131299","journal-title":"Transp Sci"},{"key":"3774_CR37","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cor.2017.02.020","volume":"86","author":"B Gendron","year":"2017","unstructured":"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\u201393","journal-title":"Comput Oper Res"},{"issue":"1","key":"3774_CR38","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res 150(1):150\u2013162","journal-title":"Eur J Oper Res"},{"key":"3774_CR39","volume-title":"Genetic algorithms in search, optimization & machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization & machine learning. Addison-Wesley Longman Publishing, Boston"},{"key":"3774_CR40","volume-title":"Genetic algorithms","author":"DE Goldberg","year":"2006","unstructured":"Goldberg DE (2006) Genetic algorithms. Pearson Education India, New Delhi"},{"key":"3774_CR41","doi-asserted-by":"crossref","unstructured":"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\u201909. IEEE, pp 2732\u20132739","DOI":"10.1109\/CEC.2009.4983285"},{"issue":"1","key":"3774_CR42","doi-asserted-by":"publisher","first-page":"166","DOI":"10.3390\/a7010166","volume":"7","author":"W Jakob","year":"2014","unstructured":"Jakob W, Blume C (2014) Pareto optimization or cascaded weighted sum: a comparison of concepts. Algorithms 7(1):166\u2013185","journal-title":"Algorithms"},{"issue":"12","key":"3774_CR43","doi-asserted-by":"publisher","first-page":"B-718","DOI":"10.1287\/mnsc.18.12.B718","volume":"18","author":"BM Khumawala","year":"1972","unstructured":"Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location problem. Manag Sci 18(12):B-718","journal-title":"Manag Sci"},{"issue":"2","key":"3774_CR44","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1057\/palgrave.jors.2600675","volume":"50","author":"A Klose","year":"1999","unstructured":"Klose A (1999) An LP-based heuristic for two-stage capacitated facility location problems. J Oper Res Soc 50(2):157\u2013166","journal-title":"J Oper Res Soc"},{"issue":"2","key":"3774_CR45","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/S0377-2217(99)00300-8","volume":"126","author":"A Klose","year":"2000","unstructured":"Klose A (2000) A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. Eur J Oper Res 126(2):408\u2013421","journal-title":"Eur J Oper Res"},{"key":"3774_CR46","unstructured":"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\u201370"},{"issue":"1","key":"3774_CR47","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J Krarup","year":"1983","unstructured":"Krarup J, Pruzan PM (1983) The simple plant location problem: survey and synthesis. Eur J Oper Res 12(1):36\u201381","journal-title":"Eur J Oper Res"},{"issue":"01","key":"3774_CR48","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica J, To\u0161ic D, Filipovi\u0107 V, Ljubi\u0107 I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO Oper Res 35(01):127\u2013142","journal-title":"RAIRO Oper Res"},{"issue":"7\u20138","key":"3774_CR49","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1016\/j.apm.2013.10.012","volume":"38","author":"J Kratica","year":"2014","unstructured":"Kratica J, Dugo\u0161ija D, Savi\u0107 A (2014) A new mixed integer linear programming model for the multi level uncapacitated facility location problem. Appl Math Model 38(7\u20138):2118\u20132129","journal-title":"Appl Math Model"},{"issue":"1","key":"3774_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2907050","volume":"13","author":"R Krishnaswamy","year":"2016","unstructured":"Krishnaswamy R, Sviridenko M (2016) Inapproximability of the multilevel uncapacitated facility location problem. ACM Trans Algorithms (TALG) 13(1):1","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"3774_CR51","unstructured":"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\u2013436"},{"key":"3774_CR52","volume-title":"Complexity of packing, covering and partitioning problems","author":"J Lenstra","year":"1979","unstructured":"Lenstra J, Kan AR (1979) Complexity of packing, covering and partitioning problems. Econometric Institute, Rotterdam"},{"key":"3774_CR53","unstructured":"Leung J, Aardal K, Labbe M, Queyranne M (1994) The two-level uncapacitated facility location problem. Technical report, University of Michigan, Ann Arbor, MI"},{"issue":"3","key":"3774_CR54","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s13160-014-0149-1","volume":"31","author":"E Monabbati","year":"2014","unstructured":"Monabbati E (2014) An application of a Lagrangian-type relaxation for the uncapacitated facility location problem. Jpn J Ind Appl Math 31(3):483\u2013499","journal-title":"Jpn J Ind Appl Math"},{"issue":"4","key":"3774_CR55","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TGRS.2008.2008182","volume":"47","author":"A Mukhopadhyay","year":"2009","unstructured":"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\u20131138","journal-title":"IEEE Trans Geosci Remote Sens"},{"issue":"4","key":"3774_CR56","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/2742642","volume":"47","author":"A Mukhopadhyay","year":"2015","unstructured":"Mukhopadhyay A, Maulik U, Bandyopadhyay S (2015) A survey of multiobjective evolutionary clustering. ACM Comput Surv (CSUR) 47(4):61","journal-title":"ACM Comput Surv (CSUR)"},{"key":"3774_CR57","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cose.2014.10.009","volume":"49","author":"A Patel","year":"2015","unstructured":"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\u2013122","journal-title":"Comput Secur"},{"issue":"1","key":"3774_CR58","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s40092-016-0172-8","volume":"13","author":"M Rabbani","year":"2017","unstructured":"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\u201327","journal-title":"J Ind Eng Int"},{"key":"3774_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00170-012-4051-1","volume":"64","author":"SHA Rahmati","year":"2013","unstructured":"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\u201318","journal-title":"Int J Adv Manuf Technol"},{"key":"3774_CR60","doi-asserted-by":"crossref","unstructured":"Ripon KSN, Glette K, Mirmotahari O, H\u00f8vin M, T\u00f8rresen 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\u2013168","DOI":"10.1007\/978-3-642-10684-2_18"},{"key":"3774_CR61","unstructured":"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 conference"},{"issue":"8","key":"3774_CR62","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.cor.2005.09.005","volume":"34","author":"G \u015eahin","year":"2007","unstructured":"\u015eahin G, S\u00fcral H (2007) A review of hierarchical facility location models. Comput Oper Res 34(8):2310\u20132331","journal-title":"Comput Oper Res"},{"issue":"6","key":"3774_CR63","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17\u201326","journal-title":"Computer"},{"issue":"9","key":"3774_CR64","doi-asserted-by":"publisher","first-page":"2563","DOI":"10.1016\/j.cor.2005.07.014","volume":"33","author":"M Sun","year":"2006","unstructured":"Sun M (2006) Solving the uncapacitated facility location problem using tabu search. Comput Oper Res 33(9):2563\u20132589","journal-title":"Comput Oper Res"},{"key":"3774_CR65","unstructured":"Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proceedings of the 3rd international conference on genetic algorithms"},{"issue":"1","key":"3774_CR66","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0377-2217(84)90258-3","volume":"18","author":"DW Tcha","year":"1984","unstructured":"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\u201343","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3774_CR67","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J Zhang","year":"2006","unstructured":"Zhang J (2006) Approximating the two-level facility location problem via a quasi-greedy approach. Math Program 108(1):159\u2013176","journal-title":"Math Program"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03774-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03774-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03774-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T20:26:56Z","timestamp":1579638416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03774-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,22]]},"references-count":67,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3774"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03774-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,22]]},"assertion":[{"value":"22 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"This section is to certify that we have no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}