{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T12:03:07Z","timestamp":1778673787075,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T00:00:00Z","timestamp":1508457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12351-017-0357-y","type":"journal-article","created":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T15:16:39Z","timestamp":1508512599000},"page":"827-855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A bi-level maximal covering location problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Martha-Selene","family":"Casas-Ram\u00edrez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9-Fernando","family":"Camacho-Vallejo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dolores E.","family":"Luna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,20]]},"reference":[{"key":"357_CR1","first-page":"3","volume":"14","author":"EV Alekseeva","year":"2007","unstructured":"Alekseeva EV, Kochetov TA (2007) Genetic local search for the p-median problem with client\u2019s preferences. Diskret Anal Issled Oper 14:3\u201331","journal-title":"Diskret Anal Issled Oper"},{"key":"357_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-37838-6_2","volume-title":"Metaheuristics for bi-level optimization","author":"JM Arroyo","year":"2013","unstructured":"Arroyo JM, Fern\u00e1ndez FJ (2013) A genetic algorithm for power system vulnerability analysis under multiple contingencies. In: Talbi EG (ed) Metaheuristics for bi-level optimization. Springer, Berlin, pp 41\u201368"},{"key":"357_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2598-3","author":"S Atta","year":"2017","unstructured":"Atta S, Sinha PR, Mukhopadhyay A (2017) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput. doi: 10.1007\/s00500-017-2598-3","journal-title":"Soft Comput"},{"issue":"4","key":"357_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10288-006-0023-3","volume":"5","author":"P Belotti","year":"2007","unstructured":"Belotti P, Labb\u00e9 M, Maffioli F, Ndiaye M (2007) A branch-and-cut method for the obnoxious p-median problem. 4OR 5(4):299\u2013314","journal-title":"4OR"},{"key":"357_CR5","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"J Bhadury","year":"2002","unstructured":"Bhadury J, Jaramillo J, Batta R (2002) On the use of genetic algorithms for location problems. Comput Oper Res 29:761\u2013779","journal-title":"Comput Oper Res"},{"key":"357_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2007.03.034","volume":"188","author":"H Calvete","year":"2008","unstructured":"Calvete H, Gal\u00e9 C, Mateo PM (2008) A new approach for solving linear bi-level problems using genetic algorithms. Eur J Oper Res 188:14\u201328","journal-title":"Eur J Oper Res"},{"key":"357_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1155\/2014\/430243","volume":"2014","author":"JF Camacho-Vallejo","year":"2014","unstructured":"Camacho-Vallejo JF, Cordero-Franco AE, Gonz\u00e1lez-Ram\u00edrez RG (2014) Solving the bi-level facility location problem under preferences by a Stackelberg-evolutionary algorithm. Math Probl Eng 2014:14","journal-title":"Math Probl Eng"},{"key":"357_CR8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0128067","author":"JF Camacho-Vallejo","year":"2015","unstructured":"Camacho-Vallejo JF, Mar-Ortiz J, L\u00f3pez-Ramos F, Pedraza R (2015) A genetic algorithm for the bi-level topological design of local area networks. PLoS ONE. doi: 10.1371\/journal.pone.0128067","journal-title":"PLoS ONE"},{"issue":"2","key":"357_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.orl.2006.01.012","volume":"35","author":"L C\u00e1novas","year":"2007","unstructured":"C\u00e1novas L, Garc\u00eda S, Labb\u00e9 M, Mar\u00edn A (2007) A strengthened formulation for the simple plant location problem with order. Oper Res Lett 35(2):141\u2013150","journal-title":"Oper Res Lett"},{"issue":"6","key":"357_CR10","first-page":"7272","volume":"3","author":"M Channakrishnaraju","year":"2014","unstructured":"Channakrishnaraju M (2014) Design of memetic algorithm to enhance coverage in wireless sensor networks with minimum number of sensors. Sensors 3(6):7272\u20137278","journal-title":"Sensors"},{"issue":"1","key":"357_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"RL Church","year":"1974","unstructured":"Church RL, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci Assoc 32(1):101\u2013118","journal-title":"Pap Reg Sci Assoc"},{"key":"357_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cor.2015.09.003","volume":"67","author":"F Colombo","year":"2016","unstructured":"Colombo F, Cordone R, Lulli G (2016) The multimode covering location problem. Comput Oper Res 67:25\u201333","journal-title":"Comput Oper Res"},{"issue":"3","key":"357_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF03024852","volume":"7","author":"FA Corr\u00eaa","year":"2008","unstructured":"Corr\u00eaa FA, Chaves AA, Nogueira LA (2008) Hybrid heuristics for the probabilistic maximal covering location-allocation problem. Oper Res Int J 7(3):323\u2013344","journal-title":"Oper Res Int J"},{"key":"357_CR14","doi-asserted-by":"publisher","first-page":"14535","DOI":"10.1016\/j.eswa.2011.05.031","volume":"38","author":"S Davari","year":"2011","unstructured":"Davari S, Fazel MH, Hemmati A (2011) Maximal covering location problem (MCLP) with fuzzy travel times. Expert Syst Appl 38:14535\u201314541","journal-title":"Expert Syst Appl"},{"key":"357_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.knosys.2012.12.012","volume":"41","author":"S Davari","year":"2013","unstructured":"Davari S, Fazel MH, Turksen B (2013) A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii. Knowl Based Syst 41:68\u201376","journal-title":"Knowl Based Syst"},{"key":"357_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.eswa.2017.04.002","volume":"82","author":"JA D\u00edaz","year":"2017","unstructured":"D\u00edaz JA, Luna E, Camacho-Vallejo JF, Casas-Ram\u00edrez MS (2017) GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Syst Appl 82:67\u201376","journal-title":"Expert Syst Appl"},{"key":"357_CR17","first-page":"451","volume":"17","author":"HA Eiselt","year":"1993","unstructured":"Eiselt HA, Laporte G, Thisse JF (1993) Competitive location models: a framework and bibliography. Transp Sci 17:451\u2013473","journal-title":"Transp Sci"},{"key":"357_CR18","first-page":"117","volume-title":"Applications of intelligent optimization in biology and medicine","author":"SK ElKady","year":"1996","unstructured":"ElKady SK, Abdelsalam HM (1996) A modified particle swarm optimization algorithm for solving capacitated maximal covering location problem in healthcare systems. In: Hassanien A-E et al (eds) Applications of intelligent optimization in biology and medicine. Springer, Berlin, pp 117\u2013133"},{"key":"357_CR19","doi-asserted-by":"publisher","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:368\u2013407","journal-title":"Comput Ind Eng"},{"key":"357_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.cie.2014.06.012","volume":"75","author":"RZ Farahani","year":"2014","unstructured":"Farahani RZ, Hassani A, Mousavi SM, Baygi MB (2014) A hybrid artificial bee colony for disruption in a hierarchical maximal covering location problem. Comput Ind Eng 75:129\u2013141","journal-title":"Comput Ind Eng"},{"issue":"6","key":"357_CR21","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1016\/j.scient.2011.11.008","volume":"18","author":"MH Fazel","year":"2011","unstructured":"Fazel MH, Davari S, Hadda SA (2011) The large scale maximal covering location problem. Sci Iran E 18(6):1564\u20131570","journal-title":"Sci Iran E"},{"key":"357_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1020914122189","volume":"111","author":"K Fisher","year":"2002","unstructured":"Fisher K (2002) Sequential discrete $$p$$ p -facility models for competitive location planning. Ann Oper Res 111:253\u2013270","journal-title":"Ann Oper Res"},{"key":"357_CR23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-319-13111-5_5","volume-title":"Location science","author":"S Garc\u00eda","year":"2015","unstructured":"Garc\u00eda S, Mar\u00edn A (2015) Covering location problems. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer International Publishing, New York, pp 93\u2013114"},{"issue":"3","key":"357_CR24","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"},{"key":"357_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0377-2217(83)90180-7","volume":"12","author":"SL Hakimi","year":"1983","unstructured":"Hakimi SL (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12:29\u201335","journal-title":"Eur J Oper Res"},{"key":"357_CR26","first-page":"44","volume":"27","author":"P Hanjoul","year":"1987","unstructured":"Hanjoul P, Peeters D (1987) A facility location problem with clients\u2019 preference orderings. Reg Sci Urban Econ 27:44\u201354","journal-title":"Reg Sci Urban Econ"},{"key":"357_CR27","unstructured":"Hansen P, Kochetov Y, Mladenovic N (2004) Lower bounds for the uncapacitated facility location problem with user preferences, Preprint G-2004-24, Mart 2004. GERAD-HEC, Montreal, Canada"},{"key":"357_CR28","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","volume":"29","author":"SR Hejazi","year":"2002","unstructured":"Hejazi SR, Memariani A, Jahanshahloo G, Sepehri MM (2002) Linear bi-level programming solution by genetic algorithm. Comput Oper Res 29:1913\u20131925","journal-title":"Comput Oper Res"},{"key":"357_CR29","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.ejor.2011.06.036","volume":"217","author":"D Kress","year":"2012","unstructured":"Kress D, Pesch E (2012) Sequential competitive location on networks. Eur J Oper Res 217:483\u2013499","journal-title":"Eur J Oper Res"},{"key":"357_CR30","unstructured":"Land MWS, Belew RK (1998) Evolutionary algorithms with local search for combinatorial optimization. Ph.D. thesis"},{"issue":"2","key":"357_CR31","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170","journal-title":"Artif Intell Rev"},{"key":"357_CR32","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.cie.2012.02.005","volume":"63","author":"JM Lee","year":"2012","unstructured":"Lee JM, Lee YH (2012) Facility location and scale decision problem with customer preference. Comput Ind Eng 63:184\u2013191","journal-title":"Comput Ind Eng"},{"key":"357_CR33","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/978-3-540-72590-9_173","volume":"4490","author":"H Li","year":"2007","unstructured":"Li H, Wang Y (2007) A genetic algorithm for solving a special class of nonlinear bi-level programming problems. Lect Notes Comput Sci 4490:1159\u20131162","journal-title":"Lect Notes Comput Sci"},{"key":"357_CR34","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1155\/2016\/9109824","volume":"2016","author":"S Maldonado-Pinto","year":"2016","unstructured":"Maldonado-Pinto S, Casas-Ram\u00edrez MS, Camacho-Vallejo JF (2016) Analyzing the performance of a hybrid heuristic for solving a bi-level location problem under different approaches to tackle the lower level. Math Probl Eng 2016:10","journal-title":"Math Probl Eng"},{"key":"357_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro\/1994280100011","volume":"28","author":"R Mathieu","year":"1994","unstructured":"Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level lineal programming. RAIRO Oper Res 28:1\u201321","journal-title":"RAIRO Oper Res"},{"key":"357_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.endm.2012.10.007","volume":"39","author":"M Mari\u0107","year":"2012","unstructured":"Mari\u0107 M, Stanimirovi\u0107 Z, Milenkovi\u0107 N (2012) Metaheuristic methods for solving the bi-level uncapacitated facility location problem with clients\u2019 preferences. Electron Notes Discret Math 39:43\u201350","journal-title":"Electron Notes Discret Math"},{"issue":"2","key":"357_CR37","doi-asserted-by":"publisher","first-page":"361","DOI":"10.2298\/YJOR130702032M","volume":"25","author":"M Mari\u0107","year":"2015","unstructured":"Mari\u0107 M, Stanimirovi\u0107 Z, Milenkovi\u0107 N, Djeni\u0107 A (2015) Metaheuristic approaches to solving large-scale bi-level uncapacitated facility location problem with clients\u2019 preferences. Yugosl J Oper Res 25(2):361\u2013378","journal-title":"Yugosl J Oper Res"},{"key":"357_CR38","doi-asserted-by":"crossref","unstructured":"Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: IEEE international conference proceedings of artificial intelligence systems (ICAIS02), pp 32","DOI":"10.1109\/ICAIS.2002.1048121"},{"issue":"4","key":"357_CR39","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1016\/j.eswa.2012.08.026","volume":"40","author":"I Ognjanovi\u0107","year":"2013","unstructured":"Ognjanovi\u0107 I, Ga\u0161evi D, Bagheri E (2013) A stratified framework for handling conditional preferences: an extension of the analytic hierarchy process. Expert Syst Appl 40(4):1094\u20131115","journal-title":"Expert Syst Appl"},{"key":"357_CR40","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.omega.2016.02.006","volume":"66","author":"NR Paul","year":"2017","unstructured":"Paul NR, Lunday BJ, Nurre SG (2017) A multiobjective, maximal conditional covering location problem applied to the relocation of hierarchical emergency response facilities. Omega 66:147\u2013158","journal-title":"Omega"},{"key":"357_CR41","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0377-2217(00)00169-7","volume":"129","author":"F Plastria","year":"2001","unstructured":"Plastria F (2001) Static competitive facility location: an overview of optimisation approaches. Eur J Oper Res 129:461\u2013470","journal-title":"Eur J Oper Res"},{"key":"357_CR42","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00291-008-0158-z","volume":"31","author":"F Plastria","year":"2009","unstructured":"Plastria F, Vanhaverbeke L (2009) Maximal covering location problem with price decision for revenue maximization in a competitive environment. OR Spectr 31:555\u2013571","journal-title":"OR Spectr"},{"key":"357_CR43","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M Resende","year":"1998","unstructured":"Resende M (1998) Computing approximate solutions of the maximum covering problem with GRASP. J Heuristics 4:161\u2013177","journal-title":"J Heuristics"},{"key":"357_CR44","doi-asserted-by":"crossref","unstructured":"Sinha A, Malo P, Deb K (2014) An improved bilevel evolutionary algorithm based on quadratic approximations. In: IEEE congress on evolutionary computation. IEEE, pp 1870\u20131877","DOI":"10.1109\/CEC.2014.6900391"},{"key":"357_CR45","first-page":"25","volume":"1","author":"DA Schilling","year":"1993","unstructured":"Schilling DA, Jayaraman V, Barkhi R (1993) A review of covering problem in facility location. Locat Sci 1:25\u201355","journal-title":"Locat Sci"},{"issue":"3","key":"357_CR46","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1134\/S1990478910030178","volume":"4","author":"IL Vasilyev","year":"2010","unstructured":"Vasilyev IL, Klimentova KB (2010) The branch and cut method for the facility location problem with client\u2019s preferences. J Appl Ind Math 4(3):441\u2013454","journal-title":"J Appl Ind Math"},{"issue":"6","key":"357_CR47","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1134\/S0965542509060098","volume":"49","author":"IL Vasil\u2019ev","year":"2009","unstructured":"Vasil\u2019ev IL, Klimentova KB, Kochetov YA (2009) New lower bounds for the facility location problem with clients\u2019 preferences. Comput Math Math Phys 49(6):1010\u20131020","journal-title":"Comput Math Math Phys"},{"issue":"4","key":"357_CR48","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1109\/3477.604100","volume":"27","author":"Y Wang","year":"1997","unstructured":"Wang Y, Fan K, Horng J (1997) Genetic-based search for error-correcting graph isomorphism. IEEE Trans Syst Man Cybern Part B 27(4):588\u2013597","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"357_CR49","doi-asserted-by":"publisher","first-page":"2550","DOI":"10.1016\/j.camwa.2008.05.006","volume":"56","author":"G Wang","year":"2008","unstructured":"Wang G, Wan Z, Wang X, Lv Y (2008) Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem. Comput Math Appl 56:2550\u20132555","journal-title":"Comput Math Appl"},{"key":"357_CR50","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.apm.2017.06.043","volume":"51","author":"B Zhang","year":"2017","unstructured":"Zhang B, Peng J, Li S (2017) Covering location problem of emergency service facilities in an uncertain environment. Appl. Math. Mod. 51:429\u2013447","journal-title":"Appl. Math. Mod."}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0357-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0357-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0357-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:11:44Z","timestamp":1693134704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0357-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,20]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["357"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0357-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,20]]},"assertion":[{"value":"29 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}