{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T07:03:02Z","timestamp":1783666982416,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"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":["Appl Intell"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10489-022-03239-3","type":"journal-article","created":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T22:03:52Z","timestamp":1648159432000},"page":"16651-16666","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An evolutionary approach for obnoxious cooperative maximum covering location problem"],"prefix":"10.1007","volume":"52","author":[{"given":"Edukondalu","family":"Chappidi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3585-4957","authenticated-orcid":false,"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"issue":"4","key":"3239_CR1","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1002\/net.21549","volume":"63","author":"I Averbakh","year":"2014","unstructured":"Averbakh I, Berman O, Krass D, Kalcsics J, Nickel S (2014) Cooperative covering problems on networks. Networks 63(4):334\u2013349","journal-title":"Networks"},{"issue":"3","key":"3239_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1080\/07408170903394355","volume":"42","author":"O Berman","year":"2009","unstructured":"Berman O, Drezner Z, Krass D (2009) Cooperative cover location problems: The planar case. IIE Transactions 42(3):232\u2013246","journal-title":"IIE Transactions"},{"issue":"3","key":"3239_CR3","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/moor.23.3.680","volume":"23","author":"E Carrizosa","year":"1998","unstructured":"Carrizosa E, Plastria F (1998) Locating an undesirable facility by generalized cutting planes. Mathematics of Operations Research 23(3):680\u2013694","journal-title":"Mathematics of Operations Research"},{"key":"3239_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.asoc.2016.09.051","volume":"52","author":"SN Chaurasia","year":"2017","unstructured":"Chaurasia SN, Singh A (2017) Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem. Applied Soft Computing 52:725\u2013747","journal-title":"Applied Soft Computing"},{"issue":"1","key":"3239_CR5","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","journal-title":"Papers of the Regional Science Association"},{"key":"3239_CR6","doi-asserted-by":"crossref","unstructured":"Church RL (2019) Understanding the Weber location paradigm. In: Contributions to location analysis. Springer, pp 69\u201388","DOI":"10.1007\/978-3-030-19111-5_2"},{"issue":"2","key":"3239_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. Transportation Science 12(2):107\u2013118","journal-title":"Transportation Science"},{"issue":"2","key":"3239_CR8","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.ejor.2016.01.047","volume":"252","author":"JM Colmenar","year":"2016","unstructured":"Colmenar JM, Greistorfer P, Mart\u00ed R, Duarte A (2016) Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem. European Journal of Operational Research 252(2):432\u2013442","journal-title":"European Journal of Operational Research"},{"key":"3239_CR9","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold"},{"key":"3239_CR10","doi-asserted-by":"publisher","first-page":"106040","DOI":"10.1016\/j.cie.2019.106040","volume":"137","author":"T Dokeroglu","year":"2019","unstructured":"Dokeroglu T, Sevinc E, Kucukyilmaz T, Cosar A (2019) A survey on new generation metaheuristic algorithms. Computers & Industrial Engineering 137:106040","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"3239_CR11","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1080\/24725854.2020.1753898","volume":"52","author":"T Drezner","year":"2020","unstructured":"Drezner T, Drezner Z, Kalczynski P (2020) Multiple obnoxious facilities location: A cooperative model. IISE Transactions 52(12):1403\u20131412","journal-title":"IISE Transactions"},{"key":"3239_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.cor.2018.06.006","volume":"98","author":"T Drezner","year":"2018","unstructured":"Drezner T, Drezner Z, Sch\u00f6bel A (2018) The Weber obnoxious facility location model: A big arc small arc approach. Computers & Operations Research 98:240\u2013250","journal-title":"Computers & Operations Research"},{"issue":"1","key":"3239_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.cor.2007.08.004","volume":"36","author":"T Drezner","year":"2009","unstructured":"Drezner T, Drezner Z, Scott CH (2009) Location of a facility minimizing nuisance to or from a planar network. Computers & Operations Research 36(1):135\u2013148","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3239_CR14","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0377-2217(86)90196-7","volume":"26","author":"Z Drezner","year":"1986","unstructured":"Drezner Z (1986) The p-cover problem. European Journal of Operational Research 26(2):312\u2013313","journal-title":"European Journal of Operational Research"},{"key":"3239_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.omega.2018.08.013","volume":"87","author":"Z Drezner","year":"2019","unstructured":"Drezner Z, Kalczynski P, Salhi S (2019) The planar multiple obnoxious facilities location problem: A voronoi based heuristic. Omega 87:105\u2013116","journal-title":"Omega"},{"issue":"4","key":"3239_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/net.21698","volume":"68","author":"Z Drezner","year":"2016","unstructured":"Drezner Z, Scott CH, Turner J (2016) Mixed planar and network single-facility location problems. Networks 68(4):271\u2013282","journal-title":"Networks"},{"issue":"1","key":"3239_CR17","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1287\/opre.1030.0077","volume":"52","author":"Z Drezner","year":"2004","unstructured":"Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of nonconvex facility location problems. Operations Research 52(1):128\u2013135","journal-title":"Operations Research"},{"issue":"2","key":"3239_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1111\/j.1467-9787.1983.tb00800.x","volume":"23","author":"Z Drezner","year":"1983","unstructured":"Drezner Z, Wesolowsky GO (1983) The location of an obnoxious facility with rectangular distances. Journal of Regional Science 23(2):241\u2013248","journal-title":"Journal of Regional Science"},{"issue":"4","key":"3239_CR19","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1111\/j.1467-9787.1995.tb01299.x","volume":"35","author":"Z Drezner","year":"1995","unstructured":"Drezner Z, Wesolowsky GO (1995) Obnoxious facility location in the interior of a planar network. Journal of Regional Science 35(4):675\u2013688","journal-title":"Journal of Regional Science"},{"issue":"3","key":"3239_CR20","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. European Journal of Operational Research 40(3):275\u2013291","journal-title":"European Journal of Operational Research"},{"key":"3239_CR21","doi-asserted-by":"crossref","unstructured":"Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of genetic algorithms, Morgan Kaufmann, pp 69\u201393","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"3239_CR22","first-page":"299","volume":"3","author":"P Hansen","year":"1981","unstructured":"Hansen P, Cohon J (1981) On the location of an obnoxious facility. Sistemi urbani Napoli 3:299\u2013317","journal-title":"Sistemi urbani Napoli"},{"issue":"2","key":"3239_CR23","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s13042-015-0466-y","volume":"8","author":"B Jayalakshmi","year":"2017","unstructured":"Jayalakshmi B, Singh A (2017) A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem. International Journal of Machine Learning and Cybernetics 8(2):691\u2013697","journal-title":"International Journal of Machine Learning and Cybernetics"},{"issue":"3","key":"3239_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0893-9659(92)90031-4","volume":"5","author":"M Kaiser","year":"1992","unstructured":"Kaiser M, Morin T (1992) Locating an obnoxious facility. Applied Mathematics Letters 5(3):25\u201326","journal-title":"Applied Mathematics Letters"},{"issue":"4","key":"3239_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.5395\/rde.2014.39.4.329","volume":"39","author":"HY Kim","year":"2014","unstructured":"Kim HY (2014) Statistical notes for clinical researchers: Nonparametric statistical methods: 2. nonparametric methods for comparing three or more groups and repeated measures. Restorative Dentistry and Endodontics 39(4):329\u2013332","journal-title":"Restorative Dentistry and Endodontics"},{"key":"3239_CR26","doi-asserted-by":"publisher","first-page":"3781","DOI":"10.1007\/s11831-021-09562-1","volume":"28","author":"W Li","year":"2021","unstructured":"Li W, Wang GG, Gandomi AH (2021) A survey of learning-based intelligent optimization algorithms. Arch Computat Methods Eng 28:3781\u20133799","journal-title":"Arch Computat Methods Eng"},{"key":"3239_CR27","unstructured":"McDonald JH (2009) Handbook of biological statistics. Sparky House Publishing Baltimore, MD, vol 2"},{"key":"3239_CR28","doi-asserted-by":"crossref","unstructured":"Melachrinoudis E (2011) The location of undesirable facilities. In: Foundations of location analysis, Springer, pp 207\u2013239","DOI":"10.1007\/978-1-4419-7572-0_10"},{"issue":"19","key":"3239_CR29","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 Computing and Applications 32(19):15643\u201315663","journal-title":"Neural Computing and Applications"},{"issue":"2\u20133","key":"3239_CR30","first-page":"109","volume":"36","author":"F Plastria","year":"1996","unstructured":"Plastria F (1996) Optimal location of undesirable facilities: a selective overview. JORBEL-Belgian Journal of Operations Research, Statistics, and Computer Science 36(2\u20133):109\u2013127","journal-title":"JORBEL-Belgian Journal of Operations Research, Statistics, and Computer Science"},{"issue":"1\u20132","key":"3239_CR31","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. Journal of Heuristics 27(1\u20132):5\u201330","journal-title":"Journal of Heuristics"},{"key":"3239_CR32","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey D (1975) Closest-point problems. In: 16th Annual symposium on foundations of computer science (SFCS 1975), IEEE, pp 151\u2013162","DOI":"10.1109\/SFCS.1975.8"},{"issue":"5","key":"3239_CR33","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. Engineering Optimization 45(5):609\u2013626","journal-title":"Engineering Optimization"},{"issue":"1","key":"3239_CR34","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ejor.2019.01.002","volume":"276","author":"K Singh","year":"2019","unstructured":"Singh K, Sundar S (2019) A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. European Journal of Operational Research 276(1):88\u2013105","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3239_CR35","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1007\/s00500-019-04051-x","volume":"24","author":"K Singh","year":"2020","unstructured":"Singh K, Sundar S (2020) A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. Soft Computing 24(3):2169\u20132186","journal-title":"Soft Computing"},{"key":"3239_CR36","unstructured":"Weber A, Friedrich C (1929) Alfred Weber\u2019s theory of the location of industries"},{"key":"3239_CR37","unstructured":"Wesolowsky GO (1993) The Weber problem: History and perspectives. Computers & Operations Research"},{"key":"3239_CR38","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 in Mathematical Statistics 1:171\u2013259","journal-title":"Selected Tables in Mathematical Statistics"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03239-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03239-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03239-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T19:38:41Z","timestamp":1668022721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03239-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,24]]},"references-count":38,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["3239"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03239-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,24]]},"assertion":[{"value":"12 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts 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"}}]}}