{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:31:33Z","timestamp":1773253893189,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":23,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PDC2022-133957-I00"],"award-info":[{"award-number":["PDC2022-133957-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2022-138860NB-I00"],"award-info":[{"award-number":["PID2022-138860NB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["RED2022-134703-T"],"award-info":[{"award-number":["RED2022-134703-T"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014849","name":"Conselleria de Cultura, Educaci\u00f3n y Ciencia, Generalitat Valenciana","doi-asserted-by":"publisher","award":["ROMETEO\/2021\/065"],"award-info":[{"award-number":["ROMETEO\/2021\/065"]}],"id":[{"id":"10.13039\/501100014849","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several fields, such as logistics and telecommunication networks. While the existing literature primarily focuses on the deterministic version of the problem, real-life scenarios often involve uncertainties like fluctuating customer demands or service costs. This paper presents a novel algorithm for addressing the UFLP under uncertainty. Our approach combines a tabu search metaheuristic with path-relinking to obtain near-optimal solutions in short computational times for the determinisitic version of the problem. The algorithm is further enhanced by integrating it with simulation techniques to solve the UFLP with random service costs. A set of computational experiments is run to illustrate the effectiveness of the solving method.<\/jats:p>","DOI":"10.1007\/s10489-024-05441-x","type":"journal-article","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T09:02:23Z","timestamp":1713949343000},"page":"5617-5638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach"],"prefix":"10.1007","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8678-6881","authenticated-orcid":false,"given":"David","family":"Peidro","sequence":"first","affiliation":[]},{"given":"Xabier A.","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Panadero","sequence":"additional","affiliation":[]},{"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"key":"5441_CR1","volume-title":"The Effect of Technical Change and Output Expansion on the Optimum Number, Size, and Location of Pear Marketing Facilities in a California Pear Producing Region","author":"JF Stollsteimer","year":"1961","unstructured":"Stollsteimer JF (1961) The Effect of Technical Change and Output Expansion on the Optimum Number, Size, and Location of Pear Marketing Facilities in a California Pear Producing Region. University of California, Berkeley"},{"issue":"4","key":"5441_CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"AA Kuehn","year":"1963","unstructured":"Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9(4):643\u2013666","journal-title":"Manage Sci"},{"issue":"2","key":"5441_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/mnsc.11.2.213","volume":"11","author":"AS Manne","year":"1964","unstructured":"Manne AS (1964) Plant location under economies-of-scale-decentralization and computation. Manage Sci 11(2):213\u2013235","journal-title":"Manage Sci"},{"key":"5441_CR4","unstructured":"Balinski ML (1966) On finding integer solutions to linear programs. In: Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems, pp. 225\u2013248. Yortown Heights, NY"},{"key":"5441_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4419-7572-0_2","volume":"155","author":"V Verter","year":"2011","unstructured":"Verter V (2011) Uncapacitated and capacitated facility location problems. Foundations of Location Analysis. 155:25\u201337","journal-title":"Foundations of Location Analysis."},{"key":"5441_CR6","unstructured":"Cornuejol G, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory. Wiley Series in Discrete Mathematics and Optimization, pp. 119\u2013171. John Wiley & Sons, New York"},{"issue":"21","key":"5441_CR7","doi-asserted-by":"crossref","first-page":"5117","DOI":"10.1080\/00207540600823195","volume":"45","author":"FJF Silva","year":"2007","unstructured":"Silva FJF, Figuera DS (2007) A capacitated facility location problem with constrained backlogging probabilities. Int J Prod Res 45(21):5117\u20135134","journal-title":"Int J Prod Res"},{"issue":"1","key":"5441_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A Klose","year":"2005","unstructured":"Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162(1):4\u201329","journal-title":"Eur J Oper Res"},{"issue":"3","key":"5441_CR9","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","volume":"221","author":"Z Yang","year":"2012","unstructured":"Yang Z, Chu F, Chen H (2012) A cut-and-solve based algorithm for the single-source capacitated facility location problem. Eur J Oper Res 221(3):521\u2013532","journal-title":"Eur J Oper Res"},{"key":"5441_CR10","doi-asserted-by":"crossref","unstructured":"Correia I, Saldanha-da-Gama F (2019) Facility location under uncertainty. Location Science, 185\u2013213","DOI":"10.1007\/978-3-030-32177-2_8"},{"key":"5441_CR11","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.simpat.2014.03.007","volume":"46","author":"G Figueira","year":"2014","unstructured":"Figueira G, Almada-Lobo B (2014) Hybrid simulation-optimization methods: A taxonomy and discussion. Simul Model Pract Theory 46:118\u2013134","journal-title":"Simul Model Pract Theory"},{"issue":"1","key":"5441_CR12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10479-015-2019-x","volume":"240","author":"S Amaran","year":"2016","unstructured":"Amaran S, Sahinidis NV, Sharda B, Bury SJ (2016) Simulation optimization: a review of algorithms and applications. Ann Oper Res 240(1):351\u2013380","journal-title":"Ann Oper Res"},{"key":"5441_CR13","doi-asserted-by":"crossref","unstructured":"Castaneda J, Martin XA, Ammouriova M, Panadero J, Juan AA (2022) A fuzzy simheuristic for the permutation flow shop problem under stochastic and fuzzy uncertainty. Mathematics 10(10)","DOI":"10.3390\/math10101760"},{"key":"5441_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.simpat.2018.04.005","volume":"86","author":"S Hatami","year":"2018","unstructured":"Hatami S, Calvet L, Fernandez-Viagas V, Framinan JM, Juan AA (2018) A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem. Simul Model Pract Theory 86:55\u201371","journal-title":"Simul Model Pract Theory"},{"issue":"5","key":"5441_CR15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Computers & Operations Research. 13(5):533\u2013549","journal-title":"Computers & Operations Research."},{"key":"5441_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1018956213524","volume":"86","author":"KS Al-Sultan","year":"1999","unstructured":"Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86:91\u2013103","journal-title":"Ann Oper Res"},{"issue":"9","key":"5441_CR17","doi-asserted-by":"crossref","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. Computers & Operations Research. 33(9):2563\u20132589","journal-title":"Computers & Operations Research."},{"issue":"6","key":"5441_CR18","doi-asserted-by":"crossref","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"},{"issue":"3","key":"5441_CR19","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M Efroymson","year":"1966","unstructured":"Efroymson M, Ray T (1966) A branch-bound algorithm for plant location. Oper Res 14(3):361\u2013368","journal-title":"Oper Res"},{"issue":"1","key":"5441_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/opre.17.1.85","volume":"17","author":"K Spielberg","year":"1969","unstructured":"Spielberg K (1969) Algorithms for the simple plant-location problem with some side conditions. Oper Res 17(1):85\u2013111","journal-title":"Oper Res"},{"issue":"2","key":"5441_CR21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M K\u00f6rkel","year":"1989","unstructured":"K\u00f6rkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39(2):157\u2013173","journal-title":"Eur J Oper Res"},{"issue":"3","key":"5441_CR22","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum DS (1982) Approximation algorithms for the set covering and vertex cover problems. SIAM J Comput 11(3):555\u2013556","journal-title":"SIAM J Comput"},{"issue":"1","key":"5441_CR23","doi-asserted-by":"crossref","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"},{"issue":"3","key":"5441_CR24","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L Michel","year":"2004","unstructured":"Michel L, Van Hentenryck P (2004) A simple tabu search for warehouse location. Eur J Oper Res 157(3):576\u2013591","journal-title":"Eur J Oper Res"},{"issue":"1","key":"5441_CR25","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","volume":"174","author":"MG Resende","year":"2006","unstructured":"Resende MG, Werneck RF (2006) A hybrid multistart heuristic for the uncapacitated facility location problem. Eur J Oper Res 174(1):54\u201368","journal-title":"Eur J Oper Res"},{"key":"5441_CR26","doi-asserted-by":"crossref","unstructured":"C Martins L Hirsch P, Juan AA (2021) Agile optimization of a two-echelon vehicle routing problem with pickup and delivery. Int Trans Oper Res 28(1):201\u2013221","DOI":"10.1111\/itor.12796"},{"issue":"4","key":"5441_CR27","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/net.22067","volume":"79","author":"LDC Martins","year":"2022","unstructured":"Martins LDC, Tarchi D, Juan AA, Fusco A (2022) Agile optimization for a real-time facility location problem in internet of vehicles networks. Networks 79(4):501\u2013514","journal-title":"Networks"},{"issue":"3","key":"5441_CR28","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K Holmberg","year":"1999","unstructured":"Holmberg K, R\u00f6nnqvist M, Yuan D (1999) An exact algorithm for the capacitated facility location problems with single sourcing. Eur J Oper Res 113(3):544\u2013559","journal-title":"Eur J Oper Res"},{"issue":"7","key":"5441_CR29","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","volume":"53","author":"JA D\u00edaz","year":"2002","unstructured":"D\u00edaz JA, Fern\u00e1ndez E (2002) A branch-and-price algorithm for the single source capacitated plant location problem. Journal of the Operational Research Society. 53(7):728\u2013740","journal-title":"Journal of the Operational Research Society."},{"issue":"6","key":"5441_CR30","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","volume":"44","author":"C-H Chen","year":"2008","unstructured":"Chen C-H, Ting C-J (2008) Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transportation Research Part E: Logistics and Transportation Review. 44(6):1099\u20131122","journal-title":"Transportation Research Part E: Logistics and Transportation Review."},{"issue":"6","key":"5441_CR31","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"RK Ahuja","year":"2004","unstructured":"Ahuja RK, Orlin JB, Pallottino S, Scaparra MP, Scutell\u00e0 MG (2004) A multi-exchange heuristic for the single-source capacitated facility location problem. Manage Sci 50(6):749\u2013760","journal-title":"Manage Sci"},{"issue":"1","key":"5441_CR32","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0966-8349(98)00046-1","volume":"6","author":"VJMF Filho","year":"1998","unstructured":"Filho VJMF, Galv\u00e3o RD (1998) A tabu search heuristic for the concentrator location problem. Locat Sci 6(1):189\u2013209","journal-title":"Locat Sci"},{"key":"5441_CR33","doi-asserted-by":"crossref","unstructured":"Delmaire H, D\u00edaz JA, Fern\u00e1ndez E, Ortega M (1999) Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR: Information Systems and Operational Research 37(3):194\u2013225","DOI":"10.1080\/03155986.1999.11732381"},{"issue":"11","key":"5441_CR34","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1080\/01605682.2019.1639478","volume":"71","author":"A Estrada-Moreno","year":"2020","unstructured":"Estrada-Moreno A, Ferrer A, Juan AA, Bagirov A, Panadero J (2020) A biased-randomised algorithm for the capacitated facility location problem with soft constraints. J Oper Res Soc 71(11):1799\u20131815","journal-title":"J Oper Res Soc"},{"issue":"1","key":"5441_CR35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1959045.1959065","volume":"42","author":"D Fotakis","year":"2011","unstructured":"Fotakis D (2011) Online and incremental algorithms for facility location. ACM SIGACT News 42(1):97\u2013131","journal-title":"ACM SIGACT News"},{"key":"5441_CR36","volume-title":"Foundations of Location Analysis","year":"2011","unstructured":"Eiselt HA, Marianov V (eds) (2011) Foundations of Location Analysis. International Series in Operations Research & Management Science. Springer, Boston, MA"},{"issue":"11","key":"5441_CR37","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1080\/07408170500469113","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) Stochastic p-robust location problems. IIE Trans 38(11):971\u2013985","journal-title":"IIE Trans"},{"issue":"3","key":"5441_CR38","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1002\/nav.3800230305","volume":"23","author":"V Balachandran","year":"1976","unstructured":"Balachandran V, Jain S (1976) Optimal facility location under random demand with general cost structure. Naval Research Logistics Quarterly. 23(3):421\u2013436","journal-title":"Naval Research Logistics Quarterly."},{"issue":"1","key":"5441_CR39","first-page":"0003","volume":"43","author":"L Reyes-Rubiano","year":"2019","unstructured":"Reyes-Rubiano L, Ferone D, Juan AA, Faulin J (2019) A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times. SORT-Statistics and Operations Research Transactions. 43(1):0003\u20130024","journal-title":"SORT-Statistics and Operations Research Transactions."},{"issue":"10","key":"5441_CR40","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1057\/s41274-016-0155-6","volume":"68","author":"J De Armas","year":"2017","unstructured":"De Armas J, Juan AA, Marqu\u00e8s JM, Pedroso JP (2017) Solving the deterministic and stochastic uncapacitated facility location problem: From a heuristic to a simheuristic. Journal of the Operational Research Society. 68(10):1161\u20131176","journal-title":"Journal of the Operational Research Society."},{"issue":"3","key":"5441_CR41","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/17477778.2019.1680262","volume":"15","author":"CL Quintero-Araujo","year":"2021","unstructured":"Quintero-Araujo CL, Guimarans D, Juan AA (2021) A simheuristic algorithm for the capacitated location routing problem with stochastic demands. Journal of Simulation. 15(3):217\u2013234","journal-title":"Journal of Simulation."},{"key":"5441_CR42","doi-asserted-by":"crossref","unstructured":"Bayliss C, Panadero J (2023) Simheuristic and learnheuristic algorithms for the temporary-facility location and queuing problem during population treatment or testing events. J Simul 0(0):1\u201320","DOI":"10.1080\/17477778.2023.2166879"},{"key":"5441_CR43","doi-asserted-by":"crossref","unstructured":"Juan AA, Keenan P, Mart\u00ed R, McGarraghy S, Panadero J, Carroll P, Oliva D (2023) A review of the role of heuristics in stochastic optimisation: From metaheuristics to learnheuristics. Ann Oper Res 320(2):831\u2013861","DOI":"10.1007\/s10479-021-04142-9"},{"issue":"4","key":"5441_CR44","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1111\/itor.12183","volume":"25","author":"MDC Marques","year":"2018","unstructured":"Marques MDC, Dias JM (2018) Dynamic location problem under uncertainty with a regret-based measure of robustness. Int Trans Oper Res 25(4):1361\u20131381","journal-title":"Int Trans Oper Res"},{"key":"5441_CR45","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/s10878-019-00404-2","volume":"38","author":"J Zhang","year":"2019","unstructured":"Zhang J, Li M, Wang Y, Wu C, Xu D (2019) Approximation algorithm for squared metric two-stage stochastic facility location problem. J Comb Optim 38:618\u2013634","journal-title":"J Comb Optim"},{"key":"5441_CR46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.106089","volume":"137","author":"M Ramshani","year":"2019","unstructured":"Ramshani M, Ostrowski J, Zhang K, Li X (2019) Two level uncapacitated facility location problem with disruptions. Computers & Industrial Engineering. 137:106089","journal-title":"Computers & Industrial Engineering."},{"key":"5441_CR47","doi-asserted-by":"crossref","unstructured":"Koca E, Noyan N, Yaman H (2021) Two-stage facility location problems with restricted recourse. IISE Transactions. 53(12):1369\u20131381","DOI":"10.1080\/24725854.2021.1910883"},{"issue":"2","key":"5441_CR48","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1504\/EJIE.2017.083257","volume":"11","author":"A Gruler","year":"2017","unstructured":"Gruler A, Quintero-Ara\u00fajo CL, Calvet L, Juan AA (2017) Waste collection under uncertainty: A simheuristic based on variable neighbourhood search. European Journal of Industrial Engineering. 11(2):228\u2013255","journal-title":"European Journal of Industrial Engineering."},{"key":"5441_CR49","doi-asserted-by":"crossref","unstructured":"Fu MC (2003) Feature article: Optimization for simulation: Theory vs. practice. INFORMS Journal on Computing 14(3):192\u2013215","DOI":"10.1287\/ijoc.14.3.192.113"},{"key":"5441_CR50","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10732-006-4192-1","volume":"12","author":"SC Ho","year":"2006","unstructured":"Ho SC, Gendreau M (2006) Path relinking for the vehicle routing problem. Journal of Heuristics. 12:55\u201372","journal-title":"Journal of Heuristics."},{"key":"5441_CR51","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng TCE (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Computers & Operations Research. 53:154\u2013164","journal-title":"Computers & Operations Research."},{"issue":"2","key":"5441_CR52","first-page":"311","volume":"44","author":"M Chica","year":"2020","unstructured":"Chica M, Juan AA, Bayliss C, Cord\u00f3n O, Kelton WD (2020) Why simheuristics? benefits, limitations, and best practices when combining metaheuristics with simulation. SORT-Statistics and Operations Research Transactions. 44(2):311\u2013334","journal-title":"SORT-Statistics and Operations Research Transactions."},{"issue":"1","key":"5441_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.13.1.1","volume":"13","author":"S Ahn","year":"1988","unstructured":"Ahn S, Cooper C, Cornuejols G, Frieze A (1988) Probabilistic analysis of a relaxation for the k-median problem. Math Oper Res 13(1):1\u201331","journal-title":"Math Oper Res"},{"key":"5441_CR54","doi-asserted-by":"crossref","unstructured":"Barahona F, Chudak FA (2000) In: Pardalos, P.M. (ed.) Solving Large Scale Uncapacitated Facility Location Problems, pp. 48\u201362. Springer, Boston, MA","DOI":"10.1007\/978-1-4757-3145-3_4"},{"issue":"2","key":"5441_CR55","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.csda.2008.08.012","volume":"53","author":"JS Kim","year":"2008","unstructured":"Kim JS, Yum B-J (2008) Selection between weibull and lognormal distributions: A comparative simulation study. Computational Statistics & Data Analysis. 53(2):477\u2013485","journal-title":"Computational Statistics & Data Analysis."},{"key":"5441_CR56","volume-title":"Design and Analysis of Experiments","author":"DC Montgomery","year":"2017","unstructured":"Montgomery DC (2017) Design and Analysis of Experiments. John wiley & Sons, Hoboken, New Jersey"},{"issue":"4","key":"5441_CR57","doi-asserted-by":"crossref","first-page":"451","DOI":"10.15302\/J-FEM-2018038","volume":"5","author":"F Glover","year":"2018","unstructured":"Glover F, Hanafi S, Guemri O, Crevits I (2018) A simple multi-wave algorithm for the uncapacitated facility location problem. Frontiers of Engineering Management. 5(4):451\u2013465","journal-title":"Frontiers of Engineering Management."},{"key":"5441_CR58","doi-asserted-by":"crossref","unstructured":"Castillo O, Melin P, Kacprzyk J, Pedrycz W (2007) Type-2 fuzzy logic: theory and applications. In: 2007 IEEE International Conference on Granular Computing (GRC 2007), pp. 145\u2013145. IEEE","DOI":"10.1109\/GRC.2007.4403084"},{"issue":"5","key":"5441_CR59","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. International Journal of Computer & Information Sciences. 11(5):341\u2013356","journal-title":"International Journal of Computer & Information Sciences."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05441-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05441-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05441-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T14:17:09Z","timestamp":1715609829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05441-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":59,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["5441"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05441-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"31 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no conflict of interest","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}