{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:23:29Z","timestamp":1772119409751,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T00:00:00Z","timestamp":1680220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T00:00:00Z","timestamp":1680220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007511","name":"Universidad Rey Juan Carlos","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007511","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This paper deals with an interesting facility location problem known as the bi-objective\n                    <jats:italic>p<\/jats:italic>\n                    -Median and\n                    <jats:italic>p<\/jats:italic>\n                    -Dispersion problem (\n                    <jats:italic>BpMD<\/jats:italic>\n                    problem). The\n                    <jats:italic>BpMD<\/jats:italic>\n                    problem seeks to locate\n                    <jats:italic>p<\/jats:italic>\n                    facilities to service a set of\n                    <jats:italic>n<\/jats:italic>\n                    demand points, and the goal is to minimize the total distance between facilities and demand points and, simultaneously, maximize the minimum distance between all pairs of hosted facilities. The problem is addressed with a novel path relinking approach, called reactive path relinking, which hybridizes two of the most extended path relinking variants: interior path relinking and exterior path relinking. Additionally, the proposal is adapted to a multi-objective perspective for finding a good approximation of the Pareto front. Computational results prove the superiority of the proposed algorithm over the best procedures found in the literature.\n                  <\/jats:p>","DOI":"10.1007\/s00500-023-07994-4","type":"journal-article","created":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T08:19:23Z","timestamp":1680596363000},"page":"8029-8059","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem"],"prefix":"10.1007","volume":"27","author":[{"given":"I.","family":"Lozano-Osorio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. D.","family":"L\u00f3pez-S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"7994_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072. https:\/\/doi.org\/10.2307\/2582903","journal-title":"J Oper Res Soc"},{"key":"7994_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.ijdrr.2017.01.017","volume":"24","author":"C Boonmee","year":"2017","unstructured":"Boonmee C, Arimura M, Asada T (2017) Facility location optimization model for emergency humanitarian logistics. Int J Disaster Risk Reduct 24:485\u2013498. https:\/\/doi.org\/10.1016\/j.ijdrr.2017.01.017","journal-title":"Int J Disaster Risk Reduct"},{"key":"7994_CR3","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1057\/jors.2013.156","volume":"65","author":"V Campos","year":"2014","unstructured":"Campos V, Mart\u00ed R, S\u00e1nchez-Oro J, Duarte A (2014) GRASP with path relinking for the orienteering problem. J Oper Res Soc 65:1800\u20131813. https:\/\/doi.org\/10.1057\/jors.2013.156","journal-title":"J Oper Res Soc"},{"key":"7994_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1111\/j.1435-5597.1974.tb00902.x","volume":"32","author":"R Church","year":"1974","unstructured":"Church R, Velle CR (1974) The maximal covering location problem. Papers Reg Sci Assoc 32:101\u2013118. https:\/\/doi.org\/10.1111\/j.1435-5597.1974.tb00902.x","journal-title":"Papers Reg Sci Assoc"},{"key":"7994_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s13748-017-0132-6","volume":"7","author":"JM Colmenar","year":"2018","unstructured":"Colmenar JM, Hoff A, Mart\u00ed R, Duarte A (2018) Scatter search for the bi-criteria p-median p-dispersion problem. Progress Artific Intell 7:31\u201340. https:\/\/doi.org\/10.1007\/s13748-017-0132-6","journal-title":"Progress Artific Intell"},{"key":"7994_CR6","doi-asserted-by":"publisher","unstructured":"Deb K (2014) Multi-objective optimization. In: Burke EK, Kendall G (eds) Search methodologies: introductory tutorials in optimization and decision support techniques, pp. 403\u2013449. Springer, Boston, MA. https:\/\/doi.org\/10.1201\/9781315183176-4","DOI":"10.1201\/9781315183176-4"},{"key":"7994_CR7","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:182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"7994_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ins.2014.10.010","volume":"296","author":"A Duarte","year":"2015","unstructured":"Duarte A, S\u00e1nchez-Oro J, Resende MG, Glover F, Mart\u00ed R (2015) Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf Sci 296:46\u201360. https:\/\/doi.org\/10.1016\/j.ins.2014.10.010","journal-title":"Inf Sci"},{"key":"7994_CR9","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo JJ, Nebro AJ (2011) Jmetal: a java framework for multi-objective optimization. Adv Eng Softw 42:760\u2013771. https:\/\/doi.org\/10.1016\/j.advengsoft.2011.05.014","journal-title":"Adv Eng Softw"},{"key":"7994_CR10","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:48\u201360. https:\/\/doi.org\/10.1016\/0377-2217(90)90297-o","journal-title":"Eur J Oper Res"},{"key":"7994_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E Erkut","year":"1989","unstructured":"Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275\u2013291. https:\/\/doi.org\/10.1016\/0377-2217(89)90420-7","journal-title":"Eur J Oper Res"},{"key":"7994_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2018.07.036","volume":"276","author":"RZ Farahani","year":"2019","unstructured":"Farahani RZ, Fallah S, Ruiz R, Hosseini S, Asgari N (2019) Or models in urban service facility location: a critical review of applications and future developments. Eur J Oper Res 276:1\u201327. https:\/\/doi.org\/10.1016\/j.ejor.2018.07.036","journal-title":"Eur J Oper Res"},{"key":"7994_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/bf01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109\u2013133. https:\/\/doi.org\/10.1007\/bf01096763","journal-title":"J Global Optim"},{"key":"7994_CR14","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.ijpe.2009.09.005","volume":"127","author":"RB Franca","year":"2010","unstructured":"Franca RB, Jones EC, Richards CN, Carlson JP (2010) Multi-objective stochastic supply chain modeling to evaluate tradeoffs between profit and quality. Int J Prod Econ 127:292\u2013299. https:\/\/doi.org\/10.1016\/j.ijpe.2009.09.005","journal-title":"Int J Prod Econ"},{"key":"7994_CR15","doi-asserted-by":"publisher","unstructured":"Glover F, Laguna M (1998). Tabu search. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, Vol 1\u20133, pp 2093\u20132229. Springer, Boston. https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_17","DOI":"10.1007\/978-1-4419-7997-1_17"},{"key":"7994_CR16","unstructured":"Hadka D (2015) Moea framework-a free and open source java framework for multiobjective optimization. version 2.11. http:\/\/www.moeaframework.org"},{"key":"7994_CR17","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450\u2013459. https:\/\/doi.org\/10.1287\/opre.12.3.450","journal-title":"Oper Res"},{"key":"7994_CR18","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462\u2013475. https:\/\/doi.org\/10.1287\/opre.13.3.462","journal-title":"Oper Res"},{"key":"7994_CR19","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10732-022-09499-z","volume":"28","author":"R Jovanovic","year":"2022","unstructured":"Jovanovic R, Sanfilippo AP, Vo\u00df S (2022) Fixed set search applied to the multi-objective minimum weighted vertex cover problem. J Heuristics 28:481\u2013508. https:\/\/doi.org\/10.1007\/s10732-022-09499-z","journal-title":"J Heuristics"},{"key":"7994_CR20","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1016\/j.ejor.2017.04.001","volume":"262","author":"M Karatas","year":"2017","unstructured":"Karatas M (2017) A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover. Eur J Oper Res 262:1040\u20131051. https:\/\/doi.org\/10.1016\/j.ejor.2017.04.001","journal-title":"Eur J Oper Res"},{"key":"7994_CR21","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.asoc.2017.10.035","volume":"62","author":"M Karatas","year":"2018","unstructured":"Karatas M, Yak\u0131c\u0131 E (2018) An iterative solution approach to a multi-objective facility location problem. Appl Soft Comput 62:272\u2013287. https:\/\/doi.org\/10.1016\/j.asoc.2017.10.035","journal-title":"Appl Soft Comput"},{"key":"7994_CR22","doi-asserted-by":"publisher","DOI":"10.1145\/3300148","author":"M Li","year":"2019","unstructured":"Li M, Yao X (2019) Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3300148","journal-title":"ACM Comput Surv"},{"key":"7994_CR23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.0966","author":"AD L\u00f3pez-S\u00e1nchez","year":"2020","unstructured":"L\u00f3pez-S\u00e1nchez AD, S\u00e1nchez-Oro J, Laguna M (2020) A new scatter search design for multiobjective combinatorial optimization with an application to facility location. INFORMS J Comput. https:\/\/doi.org\/10.1287\/ijoc.2020.0966","journal-title":"INFORMS J Comput"},{"key":"7994_CR24","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2014.06.042","volume":"240","author":"R Marti","year":"2015","unstructured":"Marti R, Campos V, Resende MG, Duarte A (2015) Multiobjective grasp with path relinking. Eur J Oper Res 240:54\u201371. https:\/\/doi.org\/10.1016\/j.ejor.2014.06.042","journal-title":"Eur J Oper Res"},{"key":"7994_CR25","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/1012016","volume":"12","author":"E Minieka","year":"1970","unstructured":"Minieka E (1970) The m-center problem. SIAM Rev 12:138\u2013139","journal-title":"SIAM Rev"},{"key":"7994_CR26","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, Moreno-P\u00e9rez JA (2007) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179:927\u2013939. https:\/\/doi.org\/10.1016\/j.ejor.2005.05.034","journal-title":"Eur J Oper Res"},{"key":"7994_CR27","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12540","volume":"37","author":"S P\u00e9rez-Pel\u00f3","year":"2020","unstructured":"P\u00e9rez-Pel\u00f3 S, S\u00e1nchez-Oro J, Duarte A (2020) Finding weaknesses in networks using greedy randomized adaptive search procedure and path relinking. Expert Syst 37:e12540. https:\/\/doi.org\/10.1111\/exsy.12540","journal-title":"Expert Syst"},{"key":"7994_CR28","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.3390\/electronics8121440","volume":"8","author":"S P\u00e9rez-Pel\u00f3","year":"2019","unstructured":"P\u00e9rez-Pel\u00f3 S, S\u00e1nchez-Oro J, L\u00f3pez-S\u00e1nchez AD, Duarte A (2019) A multi-objective parallel iterated greedy for solving the p-center and p-dispersion problem. Electronics 8:1440. https:\/\/doi.org\/10.3390\/electronics8121440","journal-title":"Electronics"},{"key":"7994_CR29","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.compchemeng.2011.03.009","volume":"35","author":"T Pinto-Varela","year":"2011","unstructured":"Pinto-Varela T, Barbosa-P\u00f3voa APF, Novais AQ (2011) Bi-objective optimization approach to the design and planning of supply chains: economic versus environmental performances. Comput Chem Eng 35:1454\u20131468. https:\/\/doi.org\/10.1016\/j.compchemeng.2011.03.009","journal-title":"Comput Chem Eng"},{"key":"7994_CR30","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"M Resende","year":"2010","unstructured":"Resende M, Mart\u00ed R, Gallego M, Duarte A (2010) Grasp and path relinking for the max-min diversity problem. Comput Oper Res 37:498\u2013508. https:\/\/doi.org\/10.1016\/j.cor.2008.05.011","journal-title":"Comput Oper Res"},{"key":"7994_CR31","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10664-013-9287-3","volume":"20","author":"J Sagrado","year":"2015","unstructured":"Sagrado J, \u00c1guila IM, Orellana FJ (2015) Multi-objective ant colony optimization for requirements selection. Empir Softw Eng 20:577\u2013610. https:\/\/doi.org\/10.1007\/s10664-013-9287-3","journal-title":"Empir Softw Eng"},{"key":"7994_CR32","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10732-017-9363-8","volume":"26","author":"J S\u00e1nchez-Oro","year":"2020","unstructured":"S\u00e1nchez-Oro J, L\u00f3pez-S\u00e1nchez AD, Colmenar JM (2020) A general variable neighborhood search for solving the multi-objective open vehicle routing problem. J Heuristics 26:423\u2013452. https:\/\/doi.org\/10.1007\/s10732-017-9363-8","journal-title":"J Heuristics"},{"key":"7994_CR33","unstructured":"Sayyady F (2012) Mathematical models and algorithms for the location of sensors on a traffic network. Ph.D. thesis. http:\/\/www.lib.ncsu.edu\/resolver\/1840.16\/8131"},{"key":"7994_CR34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.cor.2015.02.007","volume":"61","author":"F Sayyady","year":"2015","unstructured":"Sayyady F, Tutunchi GK, Fathi Y (2015) p-median and p-dispersion problems: a bi-criteria analysis. Comput Oper Res 61:46\u201355. https:\/\/doi.org\/10.1016\/j.cor.2015.02.007","journal-title":"Comput Oper Res"},{"key":"7994_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2018.08.009","volume":"101","author":"GK Tutunchi","year":"2019","unstructured":"Tutunchi GK, Fathi Y (2019) Effective methods for solving the bi-criteria p-center and p-dispersion problem. Comput Oper Res 101:43\u201354. https:\/\/doi.org\/10.1016\/j.cor.2018.08.009","journal-title":"Comput Oper Res"},{"key":"7994_CR36","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.compeleceng.2018.07.013","volume":"71","author":"S-C Wang","year":"2018","unstructured":"Wang S-C, Lin C-C, Chen T-C, Hsiao HC (2018) Multi-objective competitive location problem with distance-based attractiveness for two facilities. Comput Electric Eng 71:237\u2013250. https:\/\/doi.org\/10.1016\/j.compeleceng.2018.07.013","journal-title":"Comput Electric Eng"},{"key":"7994_CR37","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:712\u2013731. https:\/\/doi.org\/10.1109\/tevc.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"7994_CR38","doi-asserted-by":"publisher","DOI":"10.3929\/ethz-a-004284029","author":"E Zitzler","year":"2001","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. ETH Zurich. https:\/\/doi.org\/10.3929\/ethz-a-004284029","journal-title":"ETH Zurich"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07994-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-07994-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07994-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T10:23:59Z","timestamp":1684319039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-07994-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,31]]},"references-count":38,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["7994"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-07994-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1372350\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,31]]},"assertion":[{"value":"22 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animals rights"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}