{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:27:48Z","timestamp":1775240868085,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10462-021-10006-2","type":"journal-article","created":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T07:03:12Z","timestamp":1619161392000},"page":"4591-4617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Application of an improved discrete crow search algorithm with local search and elitism on a humanitarian relief case"],"prefix":"10.1007","volume":"54","author":[{"given":"\u0130brahim Mira\u00e7","family":"Elig\u00fczel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5213-6335","authenticated-orcid":false,"given":"Eren","family":"\u00d6zceylan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,23]]},"reference":[{"issue":"2","key":"10006_CR1","first-page":"391","volume":"20","author":"AY Abdelaziz","year":"2017","unstructured":"Abdelaziz AY, Fathy A (2017) A novel approach based on crow search algorithm for optimal selection of conductor size in radial distribution networks. Eng Sci Technol Int J 20(2):391\u2013402","journal-title":"Eng Sci Technol Int J"},{"key":"10006_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.eswa.2018.02.018","volume":"102","author":"M Allaoui","year":"2018","unstructured":"Allaoui M, Ahiod B, Yafrani ME (2018) A hybrid crow search algorithm for solving the DNA fragment assembly problem. Expert Syst Appl 102:44\u201356","journal-title":"Expert Syst Appl"},{"key":"10006_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O Alp","year":"2003","unstructured":"Alp O, Erkut E, Drezner Z (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122:1\u20134","journal-title":"Ann Oper Res"},{"issue":"3","key":"10006_CR4","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1007\/s10462-019-09732-5","volume":"53","author":"HA Alsattar","year":"2020","unstructured":"Alsattar HA, Zaidan AA, Zaidan BB (2020) Novel meta-heuristic bald eagle search optimisation algorithm. Artif Intell Rev 53(3):2237\u20132264","journal-title":"Artif Intell Rev"},{"key":"10006_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1\u201312","journal-title":"Comput Struct"},{"key":"10006_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.rser.2016.06.079","volume":"65","author":"FFF Bargos","year":"2016","unstructured":"Bargos FFF, W de Q Lamas, Bargos DCC, Neto MBB, Pardal PCPM (2016) Location problem method applied to sugar and ethanol mills location optimization. Renew Sustain Energy Rev 65:274\u2013282","journal-title":"Renew Sustain Energy Rev"},{"issue":"1","key":"10006_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1504\/IJMHEUR.2015.071769","volume":"4","author":"M Basti","year":"2015","unstructured":"Basti M, Sevkli M (2015) An artificial bee colony algorithm for the p-median facility location problem. Int J Metaheuristics 4(1):91","journal-title":"Int J Metaheuristics"},{"key":"10006_CR8","unstructured":"Beasley J (2004)\u00a0ORLibrary.\u00a0http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files. Accessed 21 May\u00a02020"},{"key":"10006_CR9","first-page":"1","volume":"6","author":"M Braik","year":"2020","unstructured":"Braik M, Sheta A, Al-Hiary H (2020) A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm. Neural Comput Appl 6:1\u201333","journal-title":"Neural Comput Appl"},{"issue":"32","key":"10006_CR10","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00357-015-9187-x","volume":"3","author":"MJ Brusco","year":"2015","unstructured":"Brusco MJ, Steinley D (2015) Affinity propagation and uncapacitated facility location problems. J Classif 3(32):443\u2013480","journal-title":"J Classif"},{"issue":"4","key":"10006_CR11","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1007\/s10878-015-9839-0","volume":"31","author":"K Carling","year":"2016","unstructured":"Carling K, Meng X (2016) On statistical bounds of heuristic solutions to location problems. J Comb Optim 31(4):1518\u20131549","journal-title":"J Comb Optim"},{"issue":"X","key":"10006_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1018982914742","volume":"1\u20134","author":"RD Chiyoshi","year":"2000","unstructured":"Chiyoshi RD, Fernando G (2000) A statistical analysis of simulated annealing applied to the p-median problem. Ann Oper Res 1\u20134(X):61\u201374","journal-title":"Ann Oper Res"},{"issue":"3","key":"10006_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic TG, Gendreau M, Hansen P, Mladenovi\u0107 N (2004) Cooperative parallel variable neighborhood search for the p-median. J Heuristics 10(3):293\u2013314","journal-title":"J Heuristics"},{"key":"10006_CR14","unstructured":"Dal M, \u00d6cal AD, G\u00f6ktepe D (2017) Natural disaster of Tunceli Province and its environment. In:\u00a0International regional development conference, pp 611\u2013617"},{"key":"10006_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","volume-title":"Location science","author":"MS Daskin","year":"2015","unstructured":"Daskin MS, Maass KL (2015) Location science. Springer, Berlin, pp 21\u201345"},{"key":"10006_CR16","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II.\u00a0Lecture Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol\u00a01917, pp 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"1","key":"10006_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s12597-012-0098-x","volume":"50","author":"M Dzator","year":"2013","unstructured":"Dzator M, Dzator J (2013) An effective heuristic for the P-median problem with application to ambulance location. Opsearch 50(1):60\u201374","journal-title":"Opsearch"},{"issue":"3","key":"10006_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10100-006-0001-z","volume":"14","author":"J Fathali","year":"2006","unstructured":"Fathali J, Kakhki HT, Burkard RE (2006) An ant colony algorithm for the pos\/neg weighted p-median problem. Cent Eur J Oper Res 14(3):229\u2013246","journal-title":"Cent Eur J Oper Res"},{"issue":"3","key":"10006_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2006.12.055","volume":"191","author":"K Fleszar","year":"2008","unstructured":"Fleszar K, Hindi KS (2008) An effective VNS for the capacitated p-median problem. Eur J Oper Res 191(3):612\u2013622","journal-title":"Eur J Oper Res"},{"issue":"6","key":"10006_CR20","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1504\/IJBIC.2013.058912","volume":"5","author":"GMM Fullerton","year":"2013","unstructured":"Fullerton GMM, Hughes JA, Houghten S, Anaya GF (2013) Benchmark datasets for the DNA fragment assembly problem. Int J Bio-Inspired Comput 5(6):384","journal-title":"Int J Bio-Inspired Comput"},{"issue":"7","key":"10006_CR21","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1057\/palgrave.jors.2601176","volume":"52","author":"MDH Gamal","year":"2001","unstructured":"Gamal MDH, Salhi S (2001) Constructive heuristics for the uncapacitated continuous location\u2013allocation problem. J Oper Res Soc 52(7):821\u2013829","journal-title":"J Oper Res Soc"},{"key":"10006_CR22","doi-asserted-by":"publisher","first-page":"105925","DOI":"10.1016\/j.asoc.2019.105925","volume":"86","author":"W Guo","year":"2020","unstructured":"Guo W, Liu T, Dai F, Xu P (2020) An improved whale optimization algorithm for forecasting water resources demand. Appl Soft Comput J 86:105925","journal-title":"Appl Soft Comput J"},{"key":"10006_CR23","first-page":"1","volume":"6","author":"D Gupta","year":"2018","unstructured":"Gupta D, Rodrigues JJPC, Sundaram S, Khanna A, Korotaev V, de Albuquerque VHC (2018) Usability feature extraction using modified crow search algorithm: a novel approach. Neural Comput Appl 6:1\u201311","journal-title":"Neural Comput Appl"},{"issue":"4","key":"10006_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen P, Mladenovi\u0107 N (1997) Variable neighborhood search for the p-median. Locat Sci 5(4):207\u2013226","journal-title":"Locat Sci"},{"issue":"8","key":"10006_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00521-017-3251-x","volume":"29","author":"S Hinojosa","year":"2018","unstructured":"Hinojosa S, Oliva D, Cuevas E, Pajares G, Avalos O, G\u00e1lvez J (2018) Improving multi-criterion optimization with chaos: a novel multi-objective chaotic crow search algorithm. Neural Comput Appl 29(8):319\u2013335","journal-title":"Neural Comput Appl"},{"key":"10006_CR26","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.compeleceng.2018.04.014","volume":"68","author":"V Hugo","year":"2018","unstructured":"Hugo V, De Albuquerque C (2018) Improved diagnosis of Parkinson \u2019 s disease using optimized crow search algorithm. Comput Electr Eng 68:412\u2013414","journal-title":"Comput Electr Eng"},{"key":"10006_CR27","unstructured":"Kazakovtsev LA, Stupina AA (2015) Fast genetic algorithm with greedy heuristic for p-median and k-means problems. In:\u00a0International congress ultra Mod. telecommun. control system work, vol\u00a02015,\u00a0pp 602\u2013606"},{"key":"10006_CR28","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10489-020-01685-5","volume":"51","author":"M Khaksar Manshad","year":"2020","unstructured":"Khaksar Manshad M, Meybodi MR, Salajegheh A (2020) A new irregular cellular learning automata-based evolutionary computation for time series link prediction in social networks. Appl Intell 51:71\u201384","journal-title":"Appl Intell"},{"key":"10006_CR29","doi-asserted-by":"crossref","unstructured":"Kr\u00f6mer P, Plato\u0161 J (2014) Solving the p-median problem by a simple differential evolution. In: Conference proceedings of IEEE international conference on systems, man and cybernetics, vol 2014, pp\u00a03503\u20133507","DOI":"10.1109\/SMC.2014.6974472"},{"issue":"5","key":"10006_CR30","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1088\/0031-9155\/48\/5\/304","volume":"48","author":"M Lahanas","year":"2003","unstructured":"Lahanas M, Baltas D, Giannouli S (2003) Global convergence analysis of fast multiobjective gradient-based dose optimization algorithms for high-dose-rate brachytherapy. Phys Med Biol 48(5):599\u2013617","journal-title":"Phys Med Biol"},{"issue":"3","key":"10006_CR31","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1023\/B:AURC.0000019375.23201.c1","volume":"65","author":"TV Levanova","year":"2004","unstructured":"Levanova TV, Loresh MA (2004) Algorithms of ant system and simulated annealing for the p-median problem. Autom Remote Control 65(3):431\u2013438","journal-title":"Autom Remote Control"},{"key":"10006_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.10.020","volume":"425","author":"G Lin","year":"2018","unstructured":"Lin G, Guan J (2018) A hybrid binary particle swarm optimization for the obnoxious p-median problem. Inf Sci (NY) 425:1\u201317","journal-title":"Inf Sci (NY)"},{"key":"10006_CR33","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ecolind.2017.06.009","volume":"81","author":"D Liu","year":"2017","unstructured":"Liu D et al (2017) ELM evaluation model of regional groundwater quality based on the crow search algorithm. Ecol Indic 81:302\u2013314","journal-title":"Ecol Indic"},{"key":"10006_CR34","doi-asserted-by":"crossref","unstructured":"Loranca MBB, Vel\u00e1zquez RG, ME Analco (2015) The P-median problem: a tabu search approximation proposal applied to districts. J Math Syst Sci 5(3)","DOI":"10.17265\/2159-5291\/2015.03.002"},{"issue":"3","key":"10006_CR35","doi-asserted-by":"publisher","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"},{"key":"10006_CR36","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.asoc.2018.06.040","volume":"71","author":"F Mohammadi","year":"2018","unstructured":"Mohammadi F, Abdi H (2018) A modified crow search algorithm (MCSA) for solving economic load dispatch problem. Appl Soft Comput J 71:51\u201365","journal-title":"Appl Soft Comput J"},{"issue":"3","key":"10006_CR37","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1111\/itor.12204","volume":"23","author":"\u00d6zpeynirci","year":"2016","unstructured":"\u00d6, \u00d6zpeynirci, A\u011flamaz E (2016) Pharmacy duty scheduling problem. Int Trans Oper Res 23(3):459\u2013480","journal-title":"Int Trans Oper Res"},{"key":"10006_CR38","unstructured":"Onat O, Y\u00f6n B (2018) Earthquake risk amplification based on architectural plan irregularity. In:\u00a02nd international symposium on natural hazards and disaster management, vol 1, pp 665\u2013674"},{"key":"10006_CR39","doi-asserted-by":"crossref","unstructured":"\u00d6zkan B, Mete S, \u00c7EL\u0130K E, \u00d6zceylan E (2019) GIS-based maximum covering location model in times of disasters: the case of tunceli. Beykoz Akad Derg, pp 100\u2013111","DOI":"10.14514\/byk.m.26515393.2019.sp\/100-111"},{"key":"10006_CR40","doi-asserted-by":"publisher","first-page":"105277","DOI":"10.1016\/j.knosys.2019.105277","volume":"191","author":"D Pelusi","year":"2020","unstructured":"Pelusi D, Mascella R, Tallini L, Nayak J, Naik B, Deng Y (2020) An improved moth-flame optimization algorithm with hybrid search phase. Knowl-Based Syst 191:105277","journal-title":"Knowl-Based Syst"},{"key":"10006_CR41","doi-asserted-by":"crossref","unstructured":"Pratiwi AB (2018) A hybrid cat swarm optimization - crow search algorithm for vehicle routing problem with time windows. In:\u00a0Proceedings of the\u00a0 2017 2nd int. conf. inf. technol. inf. syst. electr. eng. ICITISEE 2017, vol\u00a02018, pp 364\u2013368","DOI":"10.1109\/ICITISEE.2017.8285529"},{"issue":"1","key":"10006_CR42","doi-asserted-by":"publisher","first-page":"012025","DOI":"10.1088\/1742-6596\/974\/1\/012025","volume":"974","author":"AB Pratiwi","year":"2018","unstructured":"Pratiwi AB, Pratama A, Sa\u2019diyah I, Suprajitno H, (2018) Vehicle routing problem with time windows using natural inspired algorithms. J Phys Conf Ser 974(1):012025","journal-title":"J Phys Conf Ser"},{"issue":"1","key":"10006_CR43","doi-asserted-by":"publisher","first-page":"012002","DOI":"10.1088\/1742-6596\/1235\/1\/012002","volume":"1235","author":"P Prima","year":"2019","unstructured":"Prima P, Murni Arymurthy A (2019) Optimization of school location-allocation using Firefly Algorithm. J Phys Conf Ser 1235(1):012002","journal-title":"J Phys Conf Ser"},{"issue":"96","key":"10006_CR44","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","volume":"2","author":"E Rolland","year":"1997","unstructured":"Rolland E, Schilling DA, Current JR (1997a) An efficient tabu search procedure for the p-median problem. Eur J Oper Res 2(96):329\u2013342","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10006_CR45","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","volume":"96","author":"E Rolland","year":"1997","unstructured":"Rolland E, Schilling DA, Current JR (1997) An efficient tabu search procedure for the p-median problem. Eur J Oper Res 96(2):329\u2013342","journal-title":"Eur J Oper Res"},{"issue":"10","key":"10006_CR46","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1016\/S0305-0548(01)00033-8","volume":"29","author":"KE Rosing","year":"2002","unstructured":"Rosing KE, Hodgson MJ (2002) Heuristic concentration for the p-median: an example demonstrating how and why it works. Comput Oper Res 29(10):1317\u20131330","journal-title":"Comput Oper Res"},{"key":"10006_CR47","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.compeleceng.2017.12.032","volume":"69","author":"A Satpathy","year":"2018","unstructured":"Satpathy A, Addya SK, Turuk AK, Majhi B, Sahoo G (2018) Crow search based virtual machine placement strategy in cloud data centers with live migration. Comput Electr Eng 69:334\u2013350","journal-title":"Comput Electr Eng"},{"issue":"2","key":"10006_CR48","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s12293-020-00303-8","volume":"12","author":"N Sayyadi Shahraki","year":"2020","unstructured":"Sayyadi Shahraki N, Zahiri SH (2020) An improved multi-objective learning automata and its application in VLSI circuit design. Memet Comput 12(2):115\u2013128","journal-title":"Memet Comput"},{"issue":"1","key":"10006_CR49","first-page":"11","volume":"26","author":"M Sevkli","year":"2014","unstructured":"Sevkli M, Mamedsaidov R, Camci F (2014) A novel discrete particle swarm optimization for p-median problem. J King Saud Univ Eng Sci 26(1):11\u201319","journal-title":"J King Saud Univ Eng Sci"},{"issue":"2","key":"10006_CR50","doi-asserted-by":"publisher","first-page":"115","DOI":"10.30656\/jsmi.v3i2.1794","volume":"3","author":"N Siswanto","year":"2019","unstructured":"Siswanto N, Adianto AN, Prawira HA, Rusdiansyah A (2019) A crow search algorithm for aircraft maintenance check problem and continuous airworthiness maintenance program. J Sist dan Manaj Ind 3(2):115","journal-title":"J Sist dan Manaj Ind"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-021-10006-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-021-10006-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-021-10006-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:20:02Z","timestamp":1675210802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-021-10006-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,23]]},"references-count":50,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10006"],"URL":"https:\/\/doi.org\/10.1007\/s10462-021-10006-2","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,23]]},"assertion":[{"value":"23 April 2021","order":1,"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"}}]}}