{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:35:39Z","timestamp":1763141739953,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001843","name":"science and engineering research board","doi-asserted-by":"publisher","award":["MTR\/2017\/000391"],"award-info":[{"award-number":["MTR\/2017\/000391"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s12065-022-00701-6","type":"journal-article","created":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T06:02:57Z","timestamp":1644559377000},"page":"891-901","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Evolutionary approaches for the weighted anti-covering location problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Edukondalu","family":"Chappidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3585-4957","authenticated-orcid":false,"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,11]]},"reference":[{"key":"701_CR1","doi-asserted-by":"crossref","unstructured":"Barahona F, Weintraub A, Epstein R (1992) Habitat dispersion in forest planning and the stable set problem. Oper Res 40(1-supplement-1):S14\u2013S21","DOI":"10.1287\/opre.40.1.S14"},{"key":"701_CR2","doi-asserted-by":"crossref","unstructured":"Carrizosa E, Bogl\u00e1rka G, et\u00a0al. (2015) Anti-covering problems. In: Location science. Springer, pp 115\u2013132","DOI":"10.1007\/978-3-319-13111-5_6"},{"issue":"5","key":"701_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1111\/j.1468-0394.2006.00407.x","volume":"23","author":"SS Chaudhry","year":"2006","unstructured":"Chaudhry SS (2006) A genetic algorithm approach to solving the anti-covering location problem. Exp Syst 23(5):251\u2013257","journal-title":"Exp Syst"},{"issue":"5","key":"701_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0305-0483(86)90079-4","volume":"14","author":"SS Chaudhry","year":"1986","unstructured":"Chaudhry SS, McCormick ST, Moon ID (1986) Locating independent facilities with maximum weight: greedy heuristics. Omega 14(5):383\u2013389","journal-title":"Omega"},{"issue":"3","key":"701_CR5","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10489-015-0654-1","volume":"43","author":"SN Chaurasia","year":"2015","unstructured":"Chaurasia SN, Singh A (2015) A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl Intell 43(3):512\u2013529","journal-title":"Appl Intell"},{"key":"701_CR6","doi-asserted-by":"crossref","unstructured":"Church RL, Cohon JL (1976) Multiobjective location analysis of regional energy facility siting problems. Tech. rep., Brookhaven National Lab., Upton, NY (USA)","DOI":"10.2172\/7294043"},{"issue":"2","key":"701_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/trsc.12.2.107","volume":"12","author":"RL Church","year":"1978","unstructured":"Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 12(2):107\u2013118","journal-title":"Transp Sci"},{"issue":"1","key":"701_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1057\/jors.1994.8","volume":"45","author":"JR Current","year":"1994","unstructured":"Current JR, Storbeck JE (1994) A multiobjective approach to design franchise outlet networks. J Oper Res Soc 45(1):71\u201381","journal-title":"J Oper Res Soc"},{"issue":"1","key":"701_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4\u201331","journal-title":"IEEE Trans Evol Comput"},{"key":"701_CR10","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"issue":"6","key":"701_CR11","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1061\/(ASCE)CP.1943-5487.0000175","volume":"26","author":"B Dimitrijevi\u0107","year":"2011","unstructured":"Dimitrijevi\u0107 B, Teodorovi\u0107 D, Simi\u0107 V, \u0160elmi\u0107 M (2011) Bee colony optimization approach to solving the anticovering location problem. J Comput Civ Eng 26(6):759\u2013768","journal-title":"J Comput Civ Eng"},{"issue":"1","key":"701_CR12","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","journal-title":"Eur J Oper Res"},{"issue":"2","key":"701_CR13","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/0377-2217(94)00348-3","volume":"92","author":"E Erkut","year":"1996","unstructured":"Erkut E, ReVelle C, \u00dclk\u00fcsal Y (1996) Integer-friendly formulations for the r-separation problem. Eur J Oper Res 92(2):342\u2013351","journal-title":"Eur J Oper Res"},{"key":"701_CR14","unstructured":"Garey MR, Johnson DS (2002) Computers and intractability, vol\u00a029. WH Freeman New York"},{"key":"701_CR15","doi-asserted-by":"crossref","unstructured":"Joseph D, Meidanis J, Tiwari P (1992) Determining dna sequence similarity using maximum independent set algorithms for interval graphs. In: Proceedings of the Scandinavian workshop on algorithm theory. Springer, pp 326\u2013337","DOI":"10.1007\/3-540-55706-7_29"},{"key":"701_CR16","doi-asserted-by":"crossref","unstructured":"Khorjuvenkar PR, Singh A (2019) A hybrid swarm intelligence approach for anti-covering location problem. In: Proceedings of the 2019 IEEE international conference on innovations in power and advanced computing technologies (i-PACT 2019). IEEE, vol\u00a01, pp 1\u20136","DOI":"10.1109\/i-PACT44901.2019.8960018"},{"issue":"3","key":"701_CR17","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. Manage Sci 30(3):290\u2013307","journal-title":"Manage Sci"},{"issue":"2","key":"701_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0305-0548(96)00048-2","volume":"24","author":"AT Murray","year":"1997","unstructured":"Murray AT, Church RL (1997) Solving the anti-covering location problem using lagrangian relaxation. Comput Ope Res 24(2):127\u2013140","journal-title":"Comput Ope Res"},{"issue":"4","key":"701_CR19","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Indus Eng 55(4):795\u2013816","journal-title":"Comput Indus Eng"},{"issue":"19","key":"701_CR20","doi-asserted-by":"publisher","first-page":"15643","DOI":"10.1007\/s00521-020-04898-4","volume":"32","author":"V Pandiri","year":"2020","unstructured":"Pandiri V, Singh A, Rossi A (2020) Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput Appl 32(19):15643\u201315663","journal-title":"Neural Comput Appl"},{"issue":"1\u20132","key":"701_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10732-019-09428-7","volume":"27","author":"A Rossi","year":"2021","unstructured":"Rossi A, Singh A, Sevaux M (2021) Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. J Heuristics 27(1\u20132):5\u201330","journal-title":"J Heuristics"},{"issue":"5","key":"701_CR22","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1080\/0305215X.2012.687732","volume":"45","author":"A Singh","year":"2013","unstructured":"Singh A, Rossi A, Sevaux M (2013) Matheuristic approaches for Q-coverage problem versions in wireless sensor networks. Eng Optim 45(5):609\u2013626","journal-title":"Eng Optim"},{"issue":"9","key":"701_CR23","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1007\/s13042-020-01088-5","volume":"11","author":"G Srivastava","year":"2020","unstructured":"Srivastava G, Venkatesh P, Singh A (2020) An evolution strategy based approach for cover scheduling problem in wireless sensor networks. Int J Mach Learn Cybern 11(9):1981\u20132006","journal-title":"Int J Mach Learn Cybern"},{"key":"701_CR24","doi-asserted-by":"crossref","unstructured":"Srivastava G, Singh A, Mallipeddi R (2021) A hybrid discrete differential evolution approach for the single machine total stepwise tardiness problem with release dates. In: Proceedings of the 2021 IEEE congress on evolutionary computation (CEC 2021). IEEE, pp 652\u2013659","DOI":"10.1109\/CEC45853.2021.9504914"},{"key":"701_CR25","doi-asserted-by":"publisher","first-page":"114779","DOI":"10.1016\/j.eswa.2021.114779","volume":"176","author":"G Srivastava","year":"2021","unstructured":"Srivastava G, Singh A, Mallipeddi R (2021) NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows. Expert Syst Appl 176:114779","journal-title":"Expert Syst Appl"},{"key":"701_CR26","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Pan QK, Suganthan PN, Liang YC (2007) A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (SCIS 07), IEEE, pp 251\u2013258","DOI":"10.1109\/SCIS.2007.367698"},{"key":"701_CR27","first-page":"171","volume":"1","author":"F Wilcoxon","year":"1970","unstructured":"Wilcoxon F, Katti S, Wilcox RA (1970) Critical values and probability levels for the wilcoxon rank sum test and the wilcoxon signed rank test. Selected Tables Math Stat 1:171\u2013259","journal-title":"Selected Tables Math Stat"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-022-00701-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-022-00701-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-022-00701-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T00:41:21Z","timestamp":1683765681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-022-00701-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s12065-022-00701-6","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"15 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","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"}}]}}