Skip to main content
Springer Nature Link
Log in

Application of an improved discrete crow search algorithm with local search and elitism on a humanitarian relief case

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

This paper demonstrates an application of the improved crow search algorithm (I-CSA), which is a modified version of the crow search algorithm (CSA). CSA is a recent, nature-inspired meta-heuristic optimization algorithm. I-CSA differs from CSA by allowing application on a discrete problem, which is P-median and fortifying faster convergence to an optimal or near-optimal solution. Improvements are provided by local searches which support escaping from local optima or convergence to the optimal solution, elitism enhances the intensification through the utilization of nodes by selecting the most frequent centers that appeared in hiding better locations for local search, on the P-median problem. The application of the I-CSA is structured in three phases. In the first phase, parameters of I-CSA are analyzed and optimized using well-known data tests. The test datasets for the application of I-CSA on the P-median problem were retrieved from the OR-library to present the effectiveness and applicability of I-CSA. In the second phase, 40-pmed test problems from the library are solved using I-CSA and the results are compared with known optimal results and recorded results of other meta-heuristic approaches. In addition, Wilcoxon signed-rank test is applied in order to demonstrate the performance of I-CSA compared to well-known algorithms. The results of the proposed method demonstrated a faster convergence rate and better solution in most cases when compared with the standard CSA and other well-known meta-heuristic approaches. Finally, the proposed I-CSA approach is tested on a real-life case problem including 2121 nodes in Tunceli, Turkey. Obtaining the optimal results in a reasonable time indicates that the potential of the I-CSA is high and promising. In nutshell, this paper presents an improvement to CSA and evaluates its performance in a three-phase test procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • 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–402

    Google Scholar 

  • Allaoui M, Ahiod B, Yafrani ME (2018) A hybrid crow search algorithm for solving the DNA fragment assembly problem. Expert Syst Appl 102:44–56

    Article  Google Scholar 

  • Alp O, Erkut E, Drezner Z (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122:1–4

    Article  MathSciNet  MATH  Google Scholar 

  • Alsattar HA, Zaidan AA, Zaidan BB (2020) Novel meta-heuristic bald eagle search optimisation algorithm. Artif Intell Rev 53(3):2237–2264

    Article  Google Scholar 

  • Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12

    Article  Google Scholar 

  • 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–282

    Article  Google Scholar 

  • Basti M, Sevkli M (2015) An artificial bee colony algorithm for the p-median facility location problem. Int J Metaheuristics 4(1):91

    Article  Google Scholar 

  • Beasley J (2004) ORLibrary. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files. Accessed 21 May 2020

  • 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–33

    Google Scholar 

  • Brusco MJ, Steinley D (2015) Affinity propagation and uncapacitated facility location problems. J Classif 3(32):443–480

    Article  MathSciNet  MATH  Google Scholar 

  • Carling K, Meng X (2016) On statistical bounds of heuristic solutions to location problems. J Comb Optim 31(4):1518–1549

    Article  MathSciNet  MATH  Google Scholar 

  • Chiyoshi RD, Fernando G (2000) A statistical analysis of simulated annealing applied to the p-median problem. Ann Oper Res 1–4(X):61–74

    Article  MATH  Google Scholar 

  • Crainic TG, Gendreau M, Hansen P, Mladenović N (2004) Cooperative parallel variable neighborhood search for the p-median. J Heuristics 10(3):293–314

    Article  Google Scholar 

  • Dal M, Öcal AD, Göktepe D (2017) Natural disaster of Tunceli Province and its environment. In: International regional development conference, pp 611–617

  • Daskin MS, Maass KL (2015) Location science. Springer, Berlin, pp 21–45

    Book  Google Scholar 

  • Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Lecture Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol 1917, pp 849–858

  • Dzator M, Dzator J (2013) An effective heuristic for the P-median problem with application to ambulance location. Opsearch 50(1):60–74

    Article  MathSciNet  MATH  Google Scholar 

  • 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–246

    Article  MathSciNet  MATH  Google Scholar 

  • Fleszar K, Hindi KS (2008) An effective VNS for the capacitated p-median problem. Eur J Oper Res 191(3):612–622

    Article  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

  • Gamal MDH, Salhi S (2001) Constructive heuristics for the uncapacitated continuous location–allocation problem. J Oper Res Soc 52(7):821–829

    Article  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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–11

    Google Scholar 

  • Hansen P, Mladenović N (1997) Variable neighborhood search for the p-median. Locat Sci 5(4):207–226

    Article  MATH  Google Scholar 

  • Hinojosa S, Oliva D, Cuevas E, Pajares G, Avalos O, Gálvez J (2018) Improving multi-criterion optimization with chaos: a novel multi-objective chaotic crow search algorithm. Neural Comput Appl 29(8):319–335

    Article  Google Scholar 

  • Hugo V, De Albuquerque C (2018) Improved diagnosis of Parkinson ’ s disease using optimized crow search algorithm. Comput Electr Eng 68:412–414

    Article  Google Scholar 

  • Kazakovtsev LA, Stupina AA (2015) Fast genetic algorithm with greedy heuristic for p-median and k-means problems. In: International congress ultra Mod. telecommun. control system work, vol 2015, pp 602–606

  • 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–84

    Article  Google Scholar 

  • Krömer P, Platoš 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 3503–3507

  • 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–617

    Article  Google Scholar 

  • Levanova TV, Loresh MA (2004) Algorithms of ant system and simulated annealing for the p-median problem. Autom Remote Control 65(3):431–438

    Article  MATH  Google Scholar 

  • Lin G, Guan J (2018) A hybrid binary particle swarm optimization for the obnoxious p-median problem. Inf Sci (NY) 425:1–17

    Article  MathSciNet  Google Scholar 

  • Liu D et al (2017) ELM evaluation model of regional groundwater quality based on the crow search algorithm. Ecol Indic 81:302–314

    Article  Google Scholar 

  • Loranca MBB, Velázquez RG, ME Analco (2015) The P-median problem: a tabu search approximation proposal applied to districts. J Math Syst Sci 5(3)

  • Mladenović N, Brimberg J, Hansen P, Moreno-Pérez JA (2007) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3):927–939

    Article  MathSciNet  MATH  Google Scholar 

  • Mohammadi F, Abdi H (2018) A modified crow search algorithm (MCSA) for solving economic load dispatch problem. Appl Soft Comput J 71:51–65

    Article  Google Scholar 

  • Ö, Özpeynirci, Ağlamaz E (2016) Pharmacy duty scheduling problem. Int Trans Oper Res 23(3):459–480

    Article  MathSciNet  MATH  Google Scholar 

  • Onat O, Yön B (2018) Earthquake risk amplification based on architectural plan irregularity. In: 2nd international symposium on natural hazards and disaster management, vol 1, pp 665–674

  • Özkan B, Mete S, ÇELİK E, Özceylan E (2019) GIS-based maximum covering location model in times of disasters: the case of tunceli. Beykoz Akad Derg, pp 100–111

  • 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

    Article  Google Scholar 

  • Pratiwi AB (2018) A hybrid cat swarm optimization - crow search algorithm for vehicle routing problem with time windows. In: Proceedings of the  2017 2nd int. conf. inf. technol. inf. syst. electr. eng. ICITISEE 2017, vol 2018, pp 364–368

  • Pratiwi AB, Pratama A, Sa’diyah I, Suprajitno H, (2018) Vehicle routing problem with time windows using natural inspired algorithms. J Phys Conf Ser 974(1):012025

    Article  Google Scholar 

  • Prima P, Murni Arymurthy A (2019) Optimization of school location-allocation using Firefly Algorithm. J Phys Conf Ser 1235(1):012002

    Article  Google Scholar 

  • Rolland E, Schilling DA, Current JR (1997a) An efficient tabu search procedure for the p-median problem. Eur J Oper Res 2(96):329–342

    Article  MATH  Google Scholar 

  • Rolland E, Schilling DA, Current JR (1997) An efficient tabu search procedure for the p-median problem. Eur J Oper Res 96(2):329–342

    Article  MATH  Google Scholar 

  • 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–1330

    Article  MathSciNet  MATH  Google Scholar 

  • 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–350

    Article  Google Scholar 

  • Sayyadi Shahraki N, Zahiri SH (2020) An improved multi-objective learning automata and its application in VLSI circuit design. Memet Comput 12(2):115–128

    Article  Google Scholar 

  • 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–19

    Google Scholar 

  • 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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Gaziantep University, 27100, Gaziantep, Turkey

    İbrahim Miraç Eligüzel & Eren Özceylan

Authors
  1. İbrahim Miraç Eligüzel
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Eren Özceylan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Eren Özceylan.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Eligüzel, İ.M., Özceylan, E. Application of an improved discrete crow search algorithm with local search and elitism on a humanitarian relief case. Artif Intell Rev 54, 4591–4617 (2021). https://doi.org/10.1007/s10462-021-10006-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-021-10006-2

Keywords