{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:43:38Z","timestamp":1784241818791,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T00:00:00Z","timestamp":1492646400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DST-PURSE"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s00500-017-2598-3","type":"journal-article","created":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T08:26:14Z","timestamp":1492676774000},"page":"3891-3906","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Solving maximal covering location problem using genetic algorithm with local refinement"],"prefix":"10.1007","volume":"22","author":[{"given":"Soumen","family":"Atta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Priya Ranjan","family":"Sinha\u00a0Mahapatra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anirban","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,20]]},"reference":[{"issue":"2","key":"2598_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0305-0483(96)00058-8","volume":"25","author":"B Adenso-Diaz","year":"1997","unstructured":"Adenso-Diaz B, Rodriguez F (1997) A simple search heuristic for the MCLP: application to the location of ambulance bases in a rural region. Omega 25(2):181\u2013187","journal-title":"Omega"},{"key":"2598_CR2","doi-asserted-by":"crossref","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. Proced Technol 10:492\u2013497","journal-title":"Proced Technol"},{"key":"2598_CR3","doi-asserted-by":"crossref","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","DOI":"10.1057\/jors.1990.166"},{"issue":"10","key":"2598_CR4","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1016\/j.cor.2009.11.003","volume":"37","author":"O Berman","year":"2010","unstructured":"Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37(10):1675\u20131687","journal-title":"Comput Oper Res"},{"issue":"8","key":"2598_CR5","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1057\/jors.1986.134","volume":"37","author":"CH Chung","year":"1986","unstructured":"Chung CH (1986) Recent applications of the maximal covering location planning (MCLP) model. J Oper Res Soc 37(8):735\u2013746","journal-title":"J Oper Res Soc"},{"issue":"1","key":"2598_CR6","doi-asserted-by":"crossref","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. Pap Reg Sci 32(1):101\u2013118","journal-title":"Pap Reg Sci"},{"issue":"12","key":"2598_CR7","doi-asserted-by":"crossref","first-page":"14535","DOI":"10.1016\/j.eswa.2011.05.031","volume":"38","author":"S Davari","year":"2011","unstructured":"Davari S, Zarandi MHF, Hemmati A (2011) Maximal covering location problem (MCLP) with fuzzy travel times. Expert Syst Appl 38(12):14535\u201314541","journal-title":"Expert Syst Appl"},{"issue":"10","key":"2598_CR8","doi-asserted-by":"crossref","first-page":"2729","DOI":"10.1016\/j.cor.2008.11.015","volume":"36","author":"F Assis Corr\u00eaa de","year":"2009","unstructured":"de Assis Corr\u00eaa F, Lorena LAN, Ribeiro GM (2009) A decomposition approach for the probabilistic maximal covering location\u2013allocation problem. Comput Oper Res 36(10):2729\u20132739","journal-title":"Comput Oper Res"},{"issue":"3","key":"2598_CR9","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/s00224-008-9135-9","volume":"45","author":"M Berg de","year":"2009","unstructured":"de Berg M, Cabello S, Har-Peled S (2009) Covering many or few points with unit disks. Theory Comput Syst 45(3):446\u2013469","journal-title":"Theory Comput Syst"},{"key":"2598_CR10","doi-asserted-by":"crossref","unstructured":"De Berg M, Van Kreveld M, Overmars M, Schwarzkopf OC (2000)Computational geometry: algorithms and applications. Springer. https:\/\/books.google.co.in\/books?id=C8zaAWuOIOcC","DOI":"10.1007\/978-3-662-04245-8"},{"key":"2598_CR11","volume-title":"Facility location: applications and theory","author":"Z Drezner","year":"2001","unstructured":"Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Berlin"},{"issue":"1","key":"2598_CR12","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"RZ Farahani","year":"2012","unstructured":"Farahani RZ, Asgari N, Heidari N, Hosseininia M, Goh M (2012) Covering problems in facility location: a review. Comput Ind Eng 62(1):368\u2013407","journal-title":"Comput Ind Eng"},{"issue":"6","key":"2598_CR13","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1016\/j.scient.2011.11.008","volume":"18","author":"M Fazel Zarandi","year":"2011","unstructured":"Fazel Zarandi M, Davari S, Haddad Sisakht S (2011) The large scale maximal covering location problem. Sci Iran 18(6):1564\u20131570","journal-title":"Sci Iran"},{"issue":"2","key":"2598_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0377-2217(99)00171-X","volume":"124","author":"RD Galv\u00e3o","year":"2000","unstructured":"Galv\u00e3o RD, Gonzalo Acosta Espejo L, Boffey B (2000) A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur J Oper Res 124(2):377\u2013389","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2598_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"RD Galv\u00e3o","year":"1996","unstructured":"Galv\u00e3o RD, ReVelle C (1996) A Lagrangean heuristic for the maximal covering location problem. Eur J Oper Res 88(1):114\u2013123","journal-title":"Eur J Oper Res"},{"key":"2598_CR16","unstructured":"Garc\u00eda-Mart\u00ednez C, Lozano M (2007) Local search based on genetic algorithms. In: Advances in metaheuristics for hard optimization. Springer, pp 199\u2013221"},{"key":"2598_CR17","unstructured":"Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness"},{"key":"2598_CR18","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York"},{"key":"2598_CR19","volume-title":"Facility location: applications and theory","author":"HW Hamacher","year":"2002","unstructured":"Hamacher HW, Drezner Z (2002) Facility location: applications and theory. Springer, New York"},{"key":"2598_CR20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1068\/a160305","volume":"16","author":"E Hillsman","year":"1984","unstructured":"Hillsman E (1984) The p-median structure as a unified linear model for location\u2013allocation analysis. Environ Plan A 16:305\u2013318","journal-title":"Environ Plan A"},{"issue":"3","key":"2598_CR21","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"6","key":"2598_CR22","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761\u2013779. doi: 10.1016\/S0305-0548(01)00021-1","journal-title":"Comput Oper Res"},{"issue":"9","key":"2598_CR23","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/S0305-0548(03)00105-9","volume":"31","author":"O Karasakal","year":"2004","unstructured":"Karasakal O, Karasakal EK (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31(9):1515\u20131526","journal-title":"Comput Oper Res"},{"key":"2598_CR24","unstructured":"Karmakar A (2011) Location problems for covering demands: algorithms and applications. Ph.D. thesis, Indian Statistical Institute, Kolkata, India"},{"issue":"4","key":"2598_CR25","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.cie.2010.01.005","volume":"58","author":"JM Lee","year":"2010","unstructured":"Lee JM, Lee YH (2010) Tabu based heuristics for the generalized hierarchical covering location problem. Comput Ind Eng 58(4):638\u2013645","journal-title":"Comput Ind Eng"},{"key":"2598_CR26","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 Hillman\u2019s edition. Int J Ind Eng 9:57\u201367","journal-title":"Int J Ind Eng"},{"key":"2598_CR27","unstructured":"Mahapatra PRS, Goswami PP, Das S (2007) Covering points by isothetic unit squares. In: CCCG, pp 169\u2013172"},{"key":"2598_CR28","unstructured":"Mahapatra PRS (2012) Studies on variations of enclosing problem using rectangular objects. Ph.D. thesis, University of Kalyani, Kalyani, West Bengal, India"},{"issue":"04","key":"2598_CR29","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1142\/S0218195915500156","volume":"25","author":"PRS Mahapatra","year":"2015","unstructured":"Mahapatra PRS, Goswami PP, Das S (2015) Placing two axis-parallel squares to maximize the number of enclosed points. Int J Comput Geom Appl 25(04):263\u2013282","journal-title":"Int J Comput Geom Appl"},{"issue":"2","key":"2598_CR30","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N Megiddo","year":"1983","unstructured":"Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J Algebraic Discrete Methods 4(2):253\u2013261","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"3","key":"2598_CR31","doi-asserted-by":"crossref","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(3):927\u2013939","journal-title":"Eur J Oper Res"},{"issue":"7","key":"2598_CR32","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/mnsc.28.7.775","volume":"28","author":"GC Moore","year":"1982","unstructured":"Moore GC, ReVelle C (1982) The hierarchical service location problem. Manag Sci 28(7):775\u2013780","journal-title":"Manag Sci"},{"issue":"4","key":"2598_CR33","doi-asserted-by":"crossref","first-page":"61:1","DOI":"10.1145\/2742642","volume":"47","author":"A Mukhopadhyay","year":"2015","unstructured":"Mukhopadhyay A, Maulik U, Bandyopadhyay S (2015) A survey of multiobjective evolutionary clustering. ACM Comput Surv 47(4):61:1\u201361:46","journal-title":"ACM Comput Surv"},{"key":"2598_CR34","doi-asserted-by":"crossref","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\u2013allocation problem. Comput Oper Res 57:51\u201359","journal-title":"Comput Oper Res"},{"key":"2598_CR35","unstructured":"Preparata F, Shamos M (1993) Computational geometry: an introduction. Monographs in Computer Science. Springer, New York. https:\/\/books.google.co.in\/books?id=gFtvRdUY09UC"},{"issue":"2","key":"2598_CR36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"MG Resende","year":"1998","unstructured":"Resende MG (1998) Computing approximate solutions of the maximum covering problem with GRASP. J Heuristics 4(2):161\u2013177","journal-title":"J Heuristics"},{"issue":"1","key":"2598_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2003.11.032","volume":"165","author":"CS ReVelle","year":"2005","unstructured":"ReVelle CS, Eiselt HA (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165(1):1\u201319","journal-title":"Eur J Oper Res"},{"key":"2598_CR38","doi-asserted-by":"crossref","unstructured":"Rodriguez FJ, Blum C, Lozano M, Garc\u00eda-Mart\u00ednez C (2012) Iterated greedy algorithms for the maximal covering location problem. In: European conference on evolutionary computation in combinatorial optimization. Springer, pp 172\u2013181","DOI":"10.1007\/978-3-642-29124-1_15"},{"key":"2598_CR39","unstructured":"Schilling DA, Jayaraman V, Barkhi R (1993) A review of covering problems in facility location. Location Sci 1(1):25\u201355"},{"key":"2598_CR40","doi-asserted-by":"publisher","unstructured":"Spieker H, Hagg A, Gaier A, Meilinger S, Asteroth A (2016) Multi-stage evolution of single-and multi-objective MCLP. Soft Comput 1\u201314. doi: 10.1007\/s00500-016-2374-9","DOI":"10.1007\/s00500-016-2374-9"},{"key":"2598_CR41","unstructured":"Weaver J, Church R (1984) A comparison of direct and indirect primal heuristic\/dual bounding solution procedures for the maximal covering location problem. Unpublished paper"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2598-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2598-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2598-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T10:37:53Z","timestamp":1569062273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2598-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,20]]},"references-count":41,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2598"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2598-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,20]]}}}