{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T04:10:28Z","timestamp":1789013428794,"version":"build-2803163510"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T00:00:00Z","timestamp":1787961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T00:00:00Z","timestamp":1787961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005222","name":"University of Jyv\u00e4skyl\u00e4","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005222","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This article presents the Energy-Regularized Bi-Objective Maximal Covering Location Problem (ERBOMCLP), an extension of the classical Maximal Covering Location Problem (MCLP) that incorporates spatial dispersion among selected facilities. The classical MCLP maximizes covered demand under a fixed facility budget and service radius, but may place facilities in spatial clusters when high-demand areas are concentrated. ERBOMCLP addresses this limitation by augmenting coverage maximization with a Riesz\u00a0\n                    <jats:italic>s<\/jats:italic>\n                    -energy objective that penalizes short inter-facility distances. To solve the model, we develop a memetic Non-dominated Sorting Genetic Algorithm II (NSGA-II) with binary fixed-cardinality encoding, problem-specific crossover and mutation operators, coverage-oriented local search, archive management, and a set-convergence-based termination criterion for detecting approximation-boundary stabilization. Experiments on ERBOMCLP instances derived from a real-world MCLP dataset show that the main memetic variant improves selected-solution coverage and often gives competitive or lower Riesz\u00a0\n                    <jats:italic>s<\/jats:italic>\n                    -energy, while the spread of the Pareto front approximation remains instance dependent. A controlled hypervolume experiment with a Riesz-nonincreasing local-search rule further improves standard dominated hypervolume on the tested instances, at the cost of substantially more objective evaluations. The study connects potential-theoretic dispersion modeling with facility-location decision support for settings where high demand coverage is primary and dispersion is a complementary proxy for geographic balance.\n                  <\/jats:p>","DOI":"10.1007\/s12293-026-00531-4","type":"journal-article","created":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T04:46:20Z","timestamp":1787978780000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Riesz $$\\varvec{s}$$-Energy Regularized Bi-Objective Maximal Covering Location Problem and its solution via a memetic algorithm"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7492-5602","authenticated-orcid":false,"given":"Soumen","family":"Atta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7342-2090","authenticated-orcid":false,"given":"Michael","family":"Emmerich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,29]]},"reference":[{"issue":"8","key":"531_CR1","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1080\/0305215X.2023.2244907","volume":"56","author":"S Atta","year":"2024","unstructured":"Atta S (2024) An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problem. Eng Optim 56(8):1298\u20131317. https:\/\/doi.org\/10.1080\/0305215X.2023.2244907","journal-title":"Eng Optim"},{"issue":"3","key":"531_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s12065-025-01042-w","volume":"18","author":"S Atta","year":"2025","unstructured":"Atta S (2025) Solving the capacitated facility location problem with service distance and outsourcing using a customized artificial bee colony algorithm. Evol Intel 18(3):60. https:\/\/doi.org\/10.1007\/s12065-025-01042-w","journal-title":"Evol Intel"},{"key":"531_CR3","doi-asserted-by":"publisher","DOI":"10.1111\/itor.70217","author":"S Atta","year":"2026","unstructured":"Atta S (2026) An enhanced adaptive large neighborhood search algorithm for the multiple allocation p-hub location problem with a mesh backbone network in video-on-demand services. Int Trans Oper Res. https:\/\/doi.org\/10.1111\/itor.70217","journal-title":"Int Trans Oper Res"},{"key":"531_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107321","volume":"186","author":"S Atta","year":"2026","unstructured":"Atta S (2026) Linear formulations and a hybrid large neighborhood search algorithm for the tool indexing problem. Comput Oper Res 186:107321. https:\/\/doi.org\/10.1016\/j.cor.2025.107321","journal-title":"Comput Oper Res"},{"key":"531_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2026.115833","volume":"1070","author":"S Atta","year":"2026","unstructured":"Atta S (2026) Riesz energy minimization facility location problem in the plane: complexity and a polynomial-time approximation scheme. Theor Comput Sci 1070:115833. https:\/\/doi.org\/10.1016\/j.tcs.2026.115833","journal-title":"Theor Comput Sci"},{"key":"531_CR6","doi-asserted-by":"publisher","unstructured":"Atta S, Emmerich M (2026) Feasibility-preserving multi-objective evolutionary algorithms with local search for the bi-objective maximal covering location problem with compactness. In: Garc\u00eda-S\u00e1nchez P, D\u00edaz\u00a0\u00c1lvarez J, Murphy A (eds) Applications of evolutionary computation. Lecture Notes in Computer Science, vol 16524. Springer Nature Switzerland, Cham, pp 52\u201368. https:\/\/doi.org\/10.1007\/978-3-032-23604-3_4","DOI":"10.1007\/978-3-032-23604-3_4"},{"key":"531_CR7","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. https:\/\/doi.org\/10.1016\/j.protcy.2013.12.387","journal-title":"Procedia Technol"},{"issue":"5","key":"531_CR8","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/s10489-019-01609-y","volume":"50","author":"S Atta","year":"2020","unstructured":"Atta S, Sen G (2020) Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach. Appl Intell 50(5):1573\u20131589. https:\/\/doi.org\/10.1007\/s10489-019-01609-y","journal-title":"Appl Intell"},{"key":"531_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107432","volume":"159","author":"S Atta","year":"2021","unstructured":"Atta S, Sen G (2021) A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services. Comput Ind Eng 159:107432. https:\/\/doi.org\/10.1016\/j.cie.2021.107432","journal-title":"Comput Ind Eng"},{"key":"531_CR10","doi-asserted-by":"publisher","first-page":"3891","DOI":"10.1007\/s00500-017-2598-3","volume":"22","author":"S Atta","year":"2018","unstructured":"Atta S, Sinha Mahapatra PR, Mukhopadhyay A (2018) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22:3891\u20133906. https:\/\/doi.org\/10.1007\/s00500-017-2598-3","journal-title":"Soft Comput"},{"issue":"16","key":"531_CR11","doi-asserted-by":"publisher","first-page":"7407","DOI":"10.1007\/s00500-018-3385-5","volume":"23","author":"S Atta","year":"2019","unstructured":"Atta S, Sinha Mahapatra PR, Mukhopadhyay A (2019) Solving tool indexing problem using harmony search algorithm with harmony refinement. Soft Comput 23(16):7407\u20137423. https:\/\/doi.org\/10.1007\/s00500-018-3385-5","journal-title":"Soft Comput"},{"key":"531_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115830","volume":"186","author":"S Atta","year":"2021","unstructured":"Atta S, Mahapatra PRS, Mukhopadhyay A (2021) A multi-objective formulation of maximal covering location problem with customers\u2019 preferences: exploring Pareto optimality-based solutions. Expert Syst Appl 186:115830. https:\/\/doi.org\/10.1016\/j.eswa.2021.115830","journal-title":"Expert Syst Appl"},{"key":"531_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108315","volume":"170","author":"S Atta","year":"2022","unstructured":"Atta S, Mahapatra PRS, Mukhopadhyay A (2022) Solving a new variant of the capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approaches. Comput Ind Eng 170:108315. https:\/\/doi.org\/10.1016\/j.cie.2022.108315","journal-title":"Comput Ind Eng"},{"key":"531_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-032-21893-3_14","volume-title":"Advances in evolutionary and deterministic methods for design, optimization and control","author":"S Atta","year":"2026","unstructured":"Atta S, Emmerich M, Basto-Fernandes V (2026) A multicriteria decision-making perspective on healthcare operations, logistics and it interoperability. In: H\u00e4m\u00e4l\u00e4inen J, Amadi M, Gauger N, Giannakoglou K, Periaux J (eds) Advances in evolutionary and deterministic methods for design, optimization and control. Springer Nature Switzerland, Cham, pp 227\u2013271. https:\/\/doi.org\/10.1007\/978-3-032-21893-3_14"},{"key":"531_CR15","unstructured":"Bartz-Beielstein T, Bartz E, Hinterleitner A, Leitenmeier C, Hussein I (2025) Multi-objective optimization with desirability and Morris-Mitchell criterion. arXiv:2512.21989"},{"issue":"3","key":"531_CR16","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653\u20131669. https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","journal-title":"Eur J Oper Res"},{"key":"531_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-030-06222-4_15","volume-title":"Business and consumer analytics: new ideas","author":"B Biesinger","year":"2019","unstructured":"Biesinger B, Hu B, Raidl GR (2019) A memetic algorithm for competitive facility location problems. In: Moscato P, de Vries NJ (eds) Business and consumer analytics: new ideas. Springer International Publishing, Cham, pp 637\u2013660. https:\/\/doi.org\/10.1007\/978-3-030-06222-4_15"},{"issue":"2","key":"531_CR18","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.jmaa.2009.03.060","volume":"356","author":"JS Brauchart","year":"2009","unstructured":"Brauchart JS, Dragnev PD, Saff EB (2009) Riesz extremal measures on the sphere for axis-supported external fields. J Math Anal Appl 356(2):769\u2013792. https:\/\/doi.org\/10.1016\/j.jmaa.2009.03.060","journal-title":"J Math Anal Appl"},{"key":"531_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s12293-016-0210-5","volume":"9","author":"JF Calder\u00edn","year":"2017","unstructured":"Calder\u00edn JF, Masegosa AD, Pelta DA (2017) An algorithm portfolio for the dynamic maximal covering location problem. Memetic Comput 9:141\u2013151. https:\/\/doi.org\/10.1007\/s12293-016-0210-5","journal-title":"Memetic Comput"},{"key":"531_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-32177-2_6","volume-title":"Location science","author":"E Carrizosa","year":"2019","unstructured":"Carrizosa E, G-T\u00f3th B (2019) Anti-covering problems. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer International Publishing, Cham, pp 123\u2013141. https:\/\/doi.org\/10.1007\/978-3-030-32177-2_6"},{"issue":"1","key":"531_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church R, ReVelle C (1974) The maximal covering location problem. Papers of the Regional Science Association 32(1):101\u2013118. https:\/\/doi.org\/10.1007\/BF01942293","journal-title":"Papers of the Regional Science Association"},{"key":"531_CR22","series-title":"Advances in spatial science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99846-6","volume-title":"Location covering models: history, applications and advancements","author":"RL Church","year":"2018","unstructured":"Church RL, Murray A (2018) Location covering models: history, applications and advancements. Advances in spatial science. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-99846-6"},{"issue":"3","key":"531_CR23","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1111\/j.1538-4632.2006.00685.x","volume":"38","author":"KM Curtin","year":"2006","unstructured":"Curtin KM, Church RL (2006) A family of location models for multiple-type discrete dispersion. Geogr Anal 38(3):248\u2013270. https:\/\/doi.org\/10.1111\/j.1538-4632.2006.00685.x","journal-title":"Geogr Anal"},{"key":"531_CR24","volume-title":"The selfish gene","author":"R Dawkins","year":"1976","unstructured":"Dawkins R (1976) The selfish gene. Oxford University Press, Oxford"},{"issue":"2","key":"531_CR25","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. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"531_CR26","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"531_CR27","doi-asserted-by":"publisher","unstructured":"Dias J, Captivo ME, Cl\u00edmaco J (2007) A memetic algorithm for dynamic location problems. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr W, Hartl RF, Reimann M (eds) Metaheuristics: progress in complex systems optimization, Springer US, Boston, pp 225\u2013244, https:\/\/doi.org\/10.1007\/978-0-387-71921-4_12","DOI":"10.1007\/978-0-387-71921-4_12"},{"issue":"2","key":"531_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10898-007-9239-9","volume":"42","author":"J Dias","year":"2008","unstructured":"Dias J, Captivo ME, Cl\u00edmaco J (2008) A memetic algorithm for multi-objective dynamic location problems. J Global Optim 42(2):221\u2013253. https:\/\/doi.org\/10.1007\/s10898-007-9239-9","journal-title":"J Global Optim"},{"key":"531_CR29","doi-asserted-by":"crossref","unstructured":"Drezner Z, Hamacher HW (eds) (2002) Facility location: applications and theory. Springer, Berlin, Heidelberg, https:\/\/link.springer.com\/book\/9783540421726","DOI":"10.1007\/978-3-642-56082-8"},{"issue":"1","key":"531_CR30","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut E (1990) The discrete p-dispersion problem. Eur J Oper Res 46(1):48\u201360. https:\/\/doi.org\/10.1016\/0377-2217(90)90297-O","journal-title":"Eur J Oper Res"},{"key":"531_CR31","doi-asserted-by":"publisher","unstructured":"Falc\u00f3n-Cardona JG, Coello\u00a0Coello CA, Emmerich M (2019) CRI-EMOA: A Pareto-Front Shape Invariant Evolutionary Multi-objective Algorithm. In: Deb K, Goodman E, Coello\u00a0Coello CA, Klamroth K, Miettinen K, Mostaghim S, Reed P (eds) Evolutionary multi-criterion optimization. Springer International Publishing, Cham, pp 307\u2013318, https:\/\/doi.org\/10.1007\/978-3-030-12598-1_25","DOI":"10.1007\/978-3-030-12598-1_25"},{"key":"531_CR32","doi-asserted-by":"publisher","unstructured":"Falc\u00f3n-Cardona JG, Ishibuchi H, Coello CAC (2020) Exploiting the trade-off between convergence and diversity indicators. In: 2020 IEEE symposium series on computational intelligence (SSCI), pp 141\u2013148, https:\/\/doi.org\/10.1109\/SSCI47803.2020.9308469","DOI":"10.1109\/SSCI47803.2020.9308469"},{"issue":"4","key":"531_CR33","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/TEVC.2024.3405197","volume":"29","author":"JG Falc\u00f3n-Cardona","year":"2025","unstructured":"Falc\u00f3n-Cardona JG, Uribe L, Rosas P (2025) Riesz s-energy as a diversity indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 29(4):1168\u20131182. https:\/\/doi.org\/10.1109\/TEVC.2024.3405197","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"531_CR34","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1109\/TEVC.2025.3570938","volume":"30","author":"JG Falc\u00f3n-Cardona","year":"2026","unstructured":"Falc\u00f3n-Cardona JG, Ju\u00e1rez J, M\u00e1rquez-Vega LA, Emmerich MTM (2026) Fast high-diversity subset selection for multiobjective optimization by Riesz $$s$$-energy. IEEE Trans Evol Comput 30(2):747\u2013761. https:\/\/doi.org\/10.1109\/TEVC.2025.3570938","journal-title":"IEEE Trans Evol Comput"},{"key":"531_CR35","doi-asserted-by":"publisher","unstructured":"Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag HD. https:\/\/doi.org\/10.1007\/978-3-7908-2151-2","DOI":"10.1007\/978-3-7908-2151-2"},{"key":"531_CR36","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-14078-0_5","volume-title":"Enhancing synergies in a collaborative environment","author":"M Forghani Youshanlo","year":"2015","unstructured":"Forghani Youshanlo M, Sahraeian R (2015) Dynamic multi-objective maximal covering location problem with gradual coverage. In: Cort\u00e9s P, Maeso-Gonz\u00e1lez E, Escudero-Santana A (eds) Enhancing synergies in a collaborative environment. Springer International Publishing, Cham, pp 39\u201347. https:\/\/doi.org\/10.1007\/978-3-319-14078-0_5"},{"key":"531_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2026.111994","volume":"216","author":"S Fugaro","year":"2026","unstructured":"Fugaro S, Sgalambro A (2026) Multi-objective facility location problems: systematic literature review and research Agenda. Comput Ind Eng 216:111994. https:\/\/doi.org\/10.1016\/j.cie.2026.111994","journal-title":"Comput Ind Eng"},{"key":"531_CR38","doi-asserted-by":"publisher","unstructured":"Gal T, Stewart TJ, Hanne T (eds) (1999) Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4615-5025-9","DOI":"10.1007\/978-1-4615-5025-9"},{"issue":"5","key":"531_CR39","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.1051\/ro\/2022167","volume":"56","author":"M Golabi","year":"2022","unstructured":"Golabi M, Shavarani SM, Idoumghar L (2022) A congested capacitated location problem with continuous network demand. RAIRO-Oper Res 56(5):3561\u20133579. https:\/\/doi.org\/10.1051\/ro\/2022167","journal-title":"RAIRO-Oper Res"},{"issue":"3","key":"531_CR40","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/atr.5670300308","volume":"30","author":"A Haghani","year":"1996","unstructured":"Haghani A (1996) Capacitated maximum covering location models: formulations and solution procedures. J Adv Transp 30(3):101\u2013136. https:\/\/doi.org\/10.1002\/atr.5670300308","journal-title":"J Adv Transp"},{"issue":"1","key":"531_CR41","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.aim.2004.05.006","volume":"193","author":"DP Hardin","year":"2005","unstructured":"Hardin DP, Saff EB (2005) Minimal Riesz energy point configurations for rectifiable d-dimensional manifolds. Adv Math 193(1):174\u2013204. https:\/\/doi.org\/10.1016\/j.aim.2004.05.006","journal-title":"Adv Math"},{"issue":"4","key":"531_CR42","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"MJ Kuby","year":"1987","unstructured":"Kuby MJ (1987) Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geogr Anal 19(4):315\u2013329. https:\/\/doi.org\/10.1111\/j.1538-4632.1987.tb00133.x","journal-title":"Geogr Anal"},{"key":"531_CR43","doi-asserted-by":"crossref","unstructured":"Landkof NS (1972) Foundations of modern potential theory, vol 180. Springer, Berlin Heidelberg. https:\/\/link.springer.com\/book\/9783642651854","DOI":"10.1007\/978-3-642-65183-0"},{"key":"531_CR44","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-031-27250-9_11","volume-title":"Evolutionary multi-criterion optimization","author":"S Liu","year":"2023","unstructured":"Liu S, Yan X, Jin Y (2023) End-to-end pareto set prediction with graph neural networks for multi-objective facility location. In: Emmerich M, Deutz A, Wang H, Kononova AV, Naujoks B, Li K, Miettinen K, Yevseyeva I (eds) Evolutionary multi-criterion optimization. Springer Nature Switzerland, Cham, pp 147\u2013161. https:\/\/doi.org\/10.1007\/978-3-031-27250-9_11"},{"issue":"1","key":"531_CR45","first-page":"57","volume":"9","author":"LA Lorena","year":"2002","unstructured":"Lorena LA, Pereira MA (2002) A Lagrangean\/surrogate heuristic for the maximal covering location problem using Hillsman\u2019s edition. Int J Ind Eng 9(1):57\u201367","journal-title":"Int J Ind Eng"},{"issue":"3","key":"531_CR46","doi-asserted-by":"publisher","first-page":"439","DOI":"10.15388\/Informatica.2014.23","volume":"25","author":"M Mari\u0107","year":"2014","unstructured":"Mari\u0107 M, Stanimirovi\u0107 Z, Djeni\u0107 A, Stanojevi\u0107 P (2014) Memetic algorithm for solving the multilevel uncapacitated facility location problem. Informatica 25(3):439\u2013466. https:\/\/doi.org\/10.15388\/Informatica.2014.23","journal-title":"Informatica"},{"key":"531_CR47","unstructured":"Marsh MT (1992) An analysis of equity measurement in facility location siting decisions. PhD thesis, The Ohio State University, http:\/\/rave.ohiolink.edu\/etdc\/view?acc_num=osu1487779120906177"},{"issue":"1","key":"531_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(94)90200-3","volume":"74","author":"MT Marsh","year":"1994","unstructured":"Marsh MT, Schilling DA (1994) Equity measurement in facility location analysis: a review and framework. Eur J Oper Res 74(1):1\u201317. https:\/\/doi.org\/10.1016\/0377-2217(94)90200-3","journal-title":"Eur J Oper Res"},{"issue":"2","key":"531_CR49","doi-asserted-by":"publisher","first-page":"178","DOI":"10.5755\/j01.itc.42.2.1768","volume":"42","author":"S Mi\u0161kovic","year":"2013","unstructured":"Mi\u0161kovic S, Stanimirovic Z (2013) A memetic algorithm for solving two variants of the two-stage uncapacitated facility location problem. Inf Technol Control 42(2):178\u2013190. https:\/\/doi.org\/10.5755\/j01.itc.42.2.1768","journal-title":"Inf Technol Control"},{"key":"531_CR50","unstructured":"Moscato P (1989) On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Tech. Rep. C3P\u00a0826, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, https:\/\/ccia.ugr.es\/~dpelta\/taxonomia\/memetic%20algorithms.htm"},{"key":"531_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23247-3","volume-title":"Handbook of memetic algorithms. Studies in computational intelligence","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithms. Studies in computational intelligence, vol 379. Springer, Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-23247-3"},{"key":"531_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2026.123470","volume":"747","author":"M Nezhadmoghaddam","year":"2026","unstructured":"Nezhadmoghaddam M, Ju\u00e1rez J, Falc\u00f3n-Cardona JG, Emmerich MT, Deutz A (2026) Approximating optimal $$\\mu $$-point distributions over a generalized sphere for Riesz s-energy using a gradient descent algorithm. Inf Sci 747:123470. https:\/\/doi.org\/10.1016\/j.ins.2026.123470","journal-title":"Inf Sci"},{"key":"531_CR53","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cor.2014.12.001","volume":"57","author":"MA Pereira","year":"2015","unstructured":"Pereira MA, Coelho LC, Lorena LA, De Souza LC (2015) A hybrid method for the probabilistic maximal covering location-allocation problem. Comput Oper Res 57:51\u201359. https:\/\/doi.org\/10.1016\/j.cor.2014.12.001","journal-title":"Comput Oper Res"},{"key":"531_CR54","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-981-96-3538-2_5","volume-title":"Evolutionary multi-criterion optimization","author":"K Pereverdieva","year":"2025","unstructured":"Pereverdieva K, Deutz A, Ezendam T, B\u00e4ck T, Hofmeyer H, Emmerich M (2025) Comparative analysis of indicators for multi-objective diversity optimization. In: Singh H, Ray T, Knowles J, Li X, Branke J, Wang B, Oyama A (eds) Evolutionary multi-criterion optimization. Springer Nature Singapore, Singapore, pp 58\u201371. https:\/\/doi.org\/10.1007\/978-981-96-3538-2_5"},{"key":"531_CR55","unstructured":"Romano J, Kromrey JD, Coraggio J, Skowronek J (2006) Appropriate statistics for ordinal level data: Should we really be using t-test and Cohen\u2019s d for evaluating group differences on the NSSE and other surveys. In: Annual Meeting of the Florida Association for Institutional Research, Cocoa Beach, FL, https:\/\/cir.nii.ac.jp\/crid\/1370016861991424001?lang=en"},{"key":"531_CR56","doi-asserted-by":"publisher","unstructured":"Salazar S, Cord\u00f3n O, Colmenar JM (2025) Efficient heuristics for the obnoxious planar p-median problem with variable sizes. Appl Soft Comput 181:113401. https:\/\/doi.org\/10.1016\/j.asoc.2025.113401","DOI":"10.1016\/j.asoc.2025.113401"},{"issue":"1","key":"531_CR57","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2016.06.036","volume":"256","author":"D Sayah","year":"2017","unstructured":"Sayah D, Irnich S (2017) A new compact formulation for the discrete p-dispersion problem. Eur J Oper Res 256(1):62\u201367. https:\/\/doi.org\/10.1016\/j.ejor.2016.06.036","journal-title":"Eur J Oper Res"},{"issue":"6","key":"531_CR58","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"531_CR59","doi-asserted-by":"publisher","unstructured":"Zitzler E, K\u00fcnzli S (2004) Indicator-based selection in multiobjective search. In: Parallel Problem Solving from Nature\u2014PPSN VIII, Lecture Notes in Computer Science, vol 3242. Springer Berlin Heidelberg, pp 832\u2013842, https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"531_CR60","doi-asserted-by":"publisher","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Tech. Rep. 103, ETH Zurich, https:\/\/doi.org\/10.3929\/ethz-a-004284029, http:\/\/hdl.handle.net\/20.500.11850\/145755","DOI":"10.3929\/ethz-a-004284029"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00531-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-026-00531-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00531-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T03:56:08Z","timestamp":1789012568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-026-00531-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,29]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s12293-026-00531-4","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,29]]},"assertion":[{"value":"18 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"47"}}