{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:41:00Z","timestamp":1761597660482},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,7]],"date-time":"2015-12-07T00:00:00Z","timestamp":1449446400000},"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":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s13042-015-0466-y","type":"journal-article","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T00:02:29Z","timestamp":1449532949000},"page":"691-697","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem"],"prefix":"10.1007","volume":"8","author":[{"given":"B.","family":"Jayalakshmi","sequence":"first","affiliation":[]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,7]]},"reference":[{"issue":"4","key":"466_CR1","doi-asserted-by":"crossref","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":"2","key":"466_CR2","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/0377-2217(94)90321-2","volume":"72","author":"O Berman","year":"1994","unstructured":"Berman O (1994) The p maximal cover\u2014p partial center problem on networks. Eur J Oper Res 72(2):432\u2013442","journal-title":"Eur J Oper Res"},{"issue":"3","key":"466_CR3","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1080\/07408170903394355","volume":"42","author":"O Berman","year":"2010","unstructured":"Berman O, Drezner Z, Krass D (2010) Cooperative cover location problems: the planar case. IIE Trans 42(3):232\u2013246","journal-title":"IIE Trans"},{"issue":"11","key":"466_CR4","doi-asserted-by":"crossref","first-page":"2002","DOI":"10.1057\/jors.2010.176","volume":"62","author":"O Berman","year":"2011","unstructured":"Berman O, Drezner Z, Krass D (2011) Discrete cooperative covering problems. J Oper Res Soc 62(11):2002\u20132012","journal-title":"J Oper Res Soc"},{"issue":"1","key":"466_CR5","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 Assoc 32(1):101\u2013118","journal-title":"Pap Reg Sci Assoc"},{"issue":"7","key":"466_CR6","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/mnsc.27.7.848","volume":"27","author":"Z Drezner","year":"1981","unstructured":"Drezner Z (1981) On a modified one-center model. Manag Sci 27(7):848\u2013851","journal-title":"Manag Sci"},{"issue":"2","key":"466_CR7","doi-asserted-by":"crossref","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. Eur J Oper Res 26(2):312\u2013313","journal-title":"Eur J Oper Res"},{"issue":"1","key":"466_CR8","doi-asserted-by":"crossref","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. Oper Res 52(1):128\u2013135","journal-title":"Oper Res"},{"issue":"5","key":"466_CR9","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1057\/jors.2009.10","volume":"61","author":"Z Drezner","year":"2010","unstructured":"Drezner Z, Suzuki A (2010) Covering continuous demand in the plane. J Oper Res Soc 61(5):878\u2013881","journal-title":"J Oper Res Soc"},{"key":"466_CR10","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. In: Technical report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, Turkey"},{"issue":"3","key":"466_CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Akay B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"issue":"1","key":"466_CR12","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Akay B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687\u2013697","journal-title":"Appl Soft Comput"},{"issue":"1","key":"466_CR13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132","journal-title":"Appl Math Comput"},{"issue":"1","key":"466_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21\u201357","journal-title":"Artif Intell Rev"},{"issue":"12","key":"466_CR15","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan P, Chua T (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181(12):2455\u20132468","journal-title":"Inf Sci"},{"issue":"2","key":"466_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1111\/j.1467-9787.1986.tb00824.x","volume":"26","author":"C ReVelle","year":"1986","unstructured":"ReVelle C (1986) The maximum capture or sphere of influence location problem: Hotelling revisited on a network. J Reg Sci 26(2):343\u2013358","journal-title":"J Reg Sci"},{"issue":"2","key":"466_CR17","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625\u2013631","journal-title":"Appl Soft Comput"},{"issue":"12","key":"466_CR18","doi-asserted-by":"crossref","first-page":"2489","DOI":"10.1007\/s00500-011-0711-6","volume":"15","author":"A Singh","year":"2011","unstructured":"Singh A, Sundar S (2011) An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput 15(12):2489\u20132499","journal-title":"Soft Comput"},{"issue":"1\u20132","key":"466_CR19","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0966-8349(96)00012-5","volume":"4","author":"A Suzuki","year":"1996","unstructured":"Suzuki A, Drezner Z (1996) The p-center location problem in an area. Locat Sci 4(1\u20132):69\u201382","journal-title":"Locat Sci"},{"issue":"2","key":"466_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(82)90109-6","volume":"11","author":"C Watson-Gandy","year":"1982","unstructured":"Watson-Gandy C (1982) Heuristic procedures for the m-partial cover problem on a plane. Eur J Oper Res 11(2):149\u2013157","journal-title":"Eur J Oper Res"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0466-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0466-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0466-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0466-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T21:59:37Z","timestamp":1718229577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0466-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["466"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0466-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,7]]}}}