{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:02:08Z","timestamp":1770742928942,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10489-024-05995-w","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T08:31:46Z","timestamp":1739262706000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Solution of reliable p-median problem with at-facility service using multi-start hyper-heuristic approaches"],"prefix":"10.1007","volume":"55","author":[{"given":"Edukondalu","family":"Chappidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"issue":"7","key":"5995_CR1","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.cor.2011.08.006","volume":"39","author":"D Aksen","year":"2012","unstructured":"Aksen D, Aras N (2012) A bilevel fixed charge location model for facilities under imminent attack. Comput Oper Res 39(7):1364\u20131381","journal-title":"Comput Oper Res"},{"issue":"3","key":"5995_CR2","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.ejor.2015.03.049","volume":"245","author":"M Albareda-Sambola","year":"2015","unstructured":"Albareda-Sambola M, Hinojosa Y, Puerto J (2015) The reliable p-median problem with at-facility service. Eur J Oper Res 245(3):656\u2013666","journal-title":"Eur J Oper Res"},{"issue":"1","key":"5995_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2012.04.016","volume":"222","author":"J Alcaraz","year":"2012","unstructured":"Alcaraz J, Landete M, Monge JF (2012) Design and analysis of hybrid metaheuristics for the reliability p-median problem. Eur J Oper Res 222(1):54\u201364","journal-title":"Eur J Oper Res"},{"issue":"1","key":"5995_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.orl.2008.09.009","volume":"37","author":"P Avella","year":"2009","unstructured":"Avella P, Boccia M, Vasilyev I (2009) Computational experience with general cutting planes for the set covering problem. Oper Res Lett 37(1):16\u201320","journal-title":"Oper Res Lett"},{"issue":"4","key":"5995_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I Averbakh","year":"1997","unstructured":"Averbakh I, Berman O (1997) Minimax regret p-center location on a network with demand uncertainty. Location Sci 5(4):247\u2013254","journal-title":"Location Sci"},{"issue":"1","key":"5995_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ijpe.2012.10.019","volume":"145","author":"N Aydin","year":"2013","unstructured":"Aydin N, Murat A (2013) A swarm intelligence based sample average approximation algorithm for the capacitated reliable facility location problem. Int J Prod Econ 145(1):173\u2013183","journal-title":"Int J Prod Econ"},{"issue":"6","key":"5995_CR7","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas E, Carrera MC (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44(6):875\u2013890","journal-title":"Oper Res"},{"key":"5995_CR8","doi-asserted-by":"crossref","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Combinatorial optimization, pp 37\u201360. Springer","DOI":"10.1007\/BFb0120886"},{"issue":"2","key":"5995_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1287\/opre.1060.0348","volume":"55","author":"O Berman","year":"2007","unstructured":"Berman O, Krass D, Menezes MB (2007) Facility reliability issues in network p-median problems: Strategic centralization and co-location effects. Oper Res 55(2):332\u2013350","journal-title":"Oper Res"},{"issue":"4","key":"5995_CR10","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1111\/j.1540-5915.2009.00253.x","volume":"40","author":"O Berman","year":"2009","unstructured":"Berman O, Krass D, Menezes MB (2009) Locating facilities in the presence of disruptions and incomplete information. Decis Sci 40(4):845\u2013868","journal-title":"Decis Sci"},{"issue":"4","key":"5995_CR11","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.omega.2012.09.002","volume":"41","author":"O Berman","year":"2013","unstructured":"Berman O, Krass D, Menezes MB (2013) Location and reliability problems on a line: Impact of objectives and correlated failures on optimal location patterns. Omega 41(4):766\u2013779","journal-title":"Omega"},{"issue":"12","key":"5995_CR12","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: A survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724","journal-title":"J Oper Res Soc"},{"key":"5995_CR13","doi-asserted-by":"crossref","unstructured":"Chakhlevitch K, Cowling P (2008) Hyperheuristics: recent developments. In: Adaptive and multilevel metaheuristics, pp 3\u201329. Springer","DOI":"10.1007\/978-3-540-79438-7_1"},{"key":"5995_CR14","doi-asserted-by":"crossref","unstructured":"Chappidi E, Singh A (2021) Discrete differential evolution-based solution for anti-covering location problem. In: Soft computing for problem solving, pp 607\u2013620. Springer","DOI":"10.1007\/978-981-16-2709-5_46"},{"issue":"22","key":"5995_CR15","doi-asserted-by":"publisher","first-page":"27269","DOI":"10.1007\/s10489-023-04983-w","volume":"53","author":"E Chappidi","year":"2023","unstructured":"Chappidi E, Singh A (2023) A hyper-heuristic based approach with naive bayes classifier for the reliability p-median problem. Appl Intell 53(22):27269\u201327289","journal-title":"Appl Intell"},{"issue":"7","key":"5995_CR16","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1002\/nav.20180","volume":"53","author":"G Chen","year":"2006","unstructured":"Chen G, Daskin MS, Shen ZJM, Uryasev S (2006) The $$\\alpha $$-reliable mean-excess regret model for stochastic facility location modeling. Naval Res Logist (NRL) 53(7):617\u2013626","journal-title":"Naval Res Logist (NRL)"},{"issue":"3","key":"5995_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","volume":"94","author":"RL Church","year":"2004","unstructured":"Church RL, Scaparra MP, Middleton RS (2004) Identifying critical infrastructure: the median and covering facility interdiction problems. Annals Assoc Am Geogr 94(3):491\u2013502","journal-title":"Annals Assoc Am Geogr"},{"key":"5995_CR18","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Soubeiga E (2000) A hyperheuristic approach to scheduling a sales summit. In: International conference on the practice and theory of automated timetabling, pp 176\u2013190. Springer","DOI":"10.1007\/3-540-44629-X_11"},{"key":"5995_CR19","doi-asserted-by":"crossref","unstructured":"Crowston WBS, Glover FW, Thompson GL, Trawick JD (1963) Probabilistic and parametric learning combinations of local job shop scheduling rules. Tech Rep Res Memo 117","DOI":"10.21236\/AD0600965"},{"key":"5995_CR20","doi-asserted-by":"crossref","unstructured":"Dasari K, Singh A (2023) A hyper-heuristic method for the traveling repairman problem with profits. In: Soft computing for problem solving: proceedings of the SocProS 2022, pp 501\u2013514. Springer","DOI":"10.1007\/978-981-19-6525-8_38"},{"issue":"10","key":"5995_CR21","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1016\/j.cor.2010.12.002","volume":"38","author":"T Davidovi\u0107","year":"2011","unstructured":"Davidovi\u0107 T, Ramljak D, \u0160elmi\u0107 M, Teodorovi\u0107 D (2011) Bee colony optimization for the p-center problem. Comput Oper Res 38(10):1367\u20131376","journal-title":"Comput Oper Res"},{"key":"5995_CR22","unstructured":"Denzinger J, Fuchs M, Fuchs M (1997) High performance atp systems by combining several ai methods. In: Proceedings of the 15th international joint conference on artifical intelligence - Volume 1, IJCAI\u201997, pp 102\u2013107. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA"},{"key":"5995_CR23","doi-asserted-by":"crossref","unstructured":"Dokeroglu T, Kucukyilmaz T, Talbi EG (2023) Hyper-heuristics: A survey and taxonomy. Comput Indust Eng 109815","DOI":"10.1016\/j.cie.2023.109815"},{"issue":"6","key":"5995_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1057\/jors.1987.88","volume":"38","author":"Z Drezner","year":"1987","unstructured":"Drezner Z (1987) Heuristic solution methods for two location problems with unreliable facilities. J Oper Res Soc 38(6):509\u2013514","journal-title":"J Oper Res Soc"},{"issue":"1","key":"5995_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1287\/trsc.23.1.51","volume":"23","author":"Z Drezner","year":"1989","unstructured":"Drezner Z (1989) Conditional p-center problems. Transp Sci 23(1):51\u201353","journal-title":"Transp Sci"},{"key":"5995_CR26","unstructured":"Drezner Z, Hamacher HW (2004) Facility location: applications and theory. Springer Science & Business Media"},{"issue":"6","key":"5995_CR27","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"ME Dyer","year":"1985","unstructured":"Dyer ME, Frieze AM (1985) A simple heuristic for the p-centre problem. Oper Res Lett 3(6):285\u2013288","journal-title":"Oper Res Lett"},{"key":"5995_CR28","unstructured":"Fisher H (1963) Probabilistic learning combinations of local job-shop scheduling rules. Industrial scheduling pp 225\u2013251"},{"key":"5995_CR29","doi-asserted-by":"crossref","unstructured":"Gade D, Pohl E (2009) Sample average approximation applied to the capacitated-facilities location problem with unreliable facilities. In: Proceedings of the institution of mechanical engineers, part o: journal of risk and reliability vol 223, no 4, pp 259\u2013269","DOI":"10.1243\/1748006XJRR246"},{"issue":"3","key":"5995_CR30","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(3):450\u2013459","journal-title":"Oper Res"},{"issue":"2","key":"5995_CR31","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1504\/IJMHEUR.2016.080264","volume":"5","author":"B Jayalakshmi","year":"2016","unstructured":"Jayalakshmi B, Singh A (2016) A swarm intelligence approach for the p-median problem. Int J Metaheuristics 5(2):136\u2013155","journal-title":"Int J Metaheuristics"},{"issue":"3","key":"5995_CR32","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. i: The p-centers. SIAM J Appl Math 37(3):513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"5995_CR33","doi-asserted-by":"crossref","unstructured":"Khorjuvenkar PR, Singh A (2019) A hybrid swarm intelligence approach for anti-covering location problem. In: 2019 Innovations in power and advanced computing technologies (i-PACT), vol\u00a01, pp 1\u20136. IEEE","DOI":"10.1109\/i-PACT44901.2019.8960018"},{"issue":"1","key":"5995_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2298\/YJOR0501053K","volume":"15","author":"Y Kochetov","year":"2005","unstructured":"Kochetov Y, Levanova T, Alekseeva E, Loresh M (2005) Large neighborhood local search for the p-median problem. Yugoslav J Oper Res 15(1):53\u201363","journal-title":"Yugoslav J Oper Res"},{"key":"5995_CR35","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.sbspro.2013.05.003","volume":"80","author":"X Li","year":"2013","unstructured":"Li X, Ouyang Y, Peng F (2013) A supporting station model for reliable infrastructure location design under interdependent disruptions. Proced-Soc Behav Sci 80:25\u201340","journal-title":"Proced-Soc Behav Sci"},{"issue":"1","key":"5995_CR36","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.cor.2010.06.002","volume":"38","author":"F Liberatore","year":"2011","unstructured":"Liberatore F, Scaparra MP, Daskin MS (2011) Analysis of facility protection strategies against an uncertain number of attacks: The stochastic r-interdiction median problem with fortification. Comput Oper Res 38(1):357\u2013366","journal-title":"Comput Oper Res"},{"issue":"1","key":"5995_CR37","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/nav.20385","volume":"57","author":"M Lim","year":"2010","unstructured":"Lim M, Daskin MS, Bassamboo A, Chopra S (2010) A facility reliability problem: Formulation, properties, and algorithm. Naval Res Logist (NRL) 57(1):58\u201370","journal-title":"Naval Res Logist (NRL)"},{"issue":"3","key":"5995_CR38","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","volume":"30","author":"ID Moon","year":"1984","unstructured":"Moon ID, Chaudhry SS (1984) An analysis of network location problems with distance constraints. Manag Sci 30(3):290\u2013307","journal-title":"Manag Sci"},{"key":"5995_CR39","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.ins.2018.06.027","volume":"463","author":"V Pandiri","year":"2018","unstructured":"Pandiri V, Singh A (2018) A hyper-heuristic based artificial bee colony algorithm for k-interconnected multi-depot multi-traveling salesman problem. Inf Sci 463:261\u2013281","journal-title":"Inf Sci"},{"issue":"4","key":"5995_CR40","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1007\/s12597-020-00463-8","volume":"57","author":"V Pandiri","year":"2020","unstructured":"Pandiri V, Singh A (2020) Two multi-start heuristics for the k-traveling salesman problem. Opsearch 57(4):1164\u20131204","journal-title":"Opsearch"},{"issue":"5","key":"5995_CR41","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10732-021-09477-x","volume":"27","author":"V Pandiri","year":"2021","unstructured":"Pandiri V, Singh A (2021) A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem. J Heuristics 27(5):791\u2013868","journal-title":"J Heuristics"},{"issue":"8","key":"5995_CR42","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1016\/j.trb.2011.05.022","volume":"45","author":"P Peng","year":"2011","unstructured":"Peng P, Snyder LV, Lim A, Liu Z (2011) Reliable logistics networks design with facility disruptions. Transp Res Part B: Methodol 45(8):1190\u20131211","journal-title":"Transp Res Part B: Methodol"},{"issue":"3","key":"5995_CR43","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"LV Snyder","year":"2005","unstructured":"Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39(3):400\u2013416","journal-title":"Transp Sci"},{"issue":"1","key":"5995_CR44","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"5995_CR45","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.ejor.2008.10.037","volume":"198","author":"Y Zhang","year":"2009","unstructured":"Zhang Y, Berman O, Verter V (2009) Incorporating congestion in preventive healthcare facility network design. Eur J Oper Res 198(3):922\u2013935","journal-title":"Eur J Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05995-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05995-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05995-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:49:50Z","timestamp":1757134190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05995-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,11]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["5995"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05995-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,11]]},"assertion":[{"value":"30 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2025","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":"Ethical approval"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"435"}}