Metaheuristic algorithms in optimization and its application: a review

Shahab Wahhab Kareem, Kurdistan Wns Hama Ali, Shavan Askar, Farah Sami Xoshaba, Roojwan Hawezi


Metaheuristic algorithms are computational intelligence paradigms especially used for solving different optimization issues.  Metaheuristics examine a collection of solutions otherwise really be wide to be thoroughly addressed or discussed in any other way. Metaheuristics can be applied to a wide range of problems because they make accurate predictions in any optimization situation. Natural processes such as the fact of evolution in Natural selection behavioral genetics, ant behaviors in genetics, swarm behaviors of certain animals, annealing in metallurgy, and others motivate metaheuristics algorithms. The big cluster search algorithm is by far the most commonly used metaheuristic algorithm. The principle behind this algorithm is that it begins with an optimal state and then uses heuristic methods from the community search algorithm to try to refine it. Many metaheuristic algorithms in diverse environments and areas are examined, compared, and described in this article. Such as Genetic Algorithm (GA), ant Colony Optimization Algorithm (ACO), Simulated Annealing (SA), Particle Swarm Optimization (PSO) algorithm, Differential Evolution (DE) algorithm and etc. Finally, show the results of each algorithm in various environments were addressed. 

Full Text:



ABDALWAHID, S. M. J., YOUSIF, R. Z. & KAREEM, S. W. 2019. Enhancing approach using hybrid pailler and RSA for information security in bigdata. Applied Computer Science, 15.

ARORA, S. & BARAK, B. 2009. Computational complexity: a modern approach, Cambridge University Press.

ASHISH, T., KAPIL, S. & MANJU, B. 2018. Parallel bat algorithm-based clustering using mapreduce. Networking Communication and Data Knowledge Engineering. Springer.

BEHESHTI, Z. 2013. Centripetal accelerated particle swarm optimization and its applications in machine learning. Universiti Teknologi Malaysia.

BEHESHTI, Z., SHAMSUDDIN, S. M. & YUHANIZ, S. S. 2013. Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems. 57, 549-573.

BEHESHTI, Z. & SHAMSUDDIN, S. M. H. 2013. A review of population-based metaheuristic algorithms. Int. J. Adv. Soft Comput. Appl, 5, 1-35.

BEWOOR, L. A., PRAKASH, V. C., SAPKAL, S. U. & ENGINEERING, C. 2017. Comparative analysis of metaheuristicapproaches for makespan minimization for no wait flow shop scheduling problem. International Journal of Electrical, 7, 417.

BOUSSAÏD, I., LEPAGNOT, J. & SIARRY, P. 2013. A survey on optimization metaheuristics. Information sciences, 237, 82-117.

CAO, Y., ZHANG, H., LI, W., ZHOU, M., ZHANG, Y. & CHAOVALITWONGSE, W. A. 2018. Comprehensive learning particle swarm optimization algorithm with local search for multimodal functions. IEEE Transactions on Evolutionary Computation, 23, 718-731.

CIVICIOGLU, P. & BESDOK, E. 2013. A conceptual comparison of the Cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms. Artificial intelligence review, 39, 315-346.

CONGRAM, R. K., POTTS, C. N. & VAN DE VELDE, S. L. 2002. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14, 52-67.

GANDOMI, A. H., YANG, X.-S., ALAVI, A. H., TALATAHARI, S. & APPLICATIONS 2013. Bat algorithm for constrained optimization tasks. Neural Computing, 22, 1239-1255.

GHODOUSI, H. & ENGINEERING 2016. Optimum Dams Reservoir Operation Considering hydropower Demands Using Dynamic Programming and Compared by Meta Heuristic Methods (Case Study Dez Dam). 3, 43-54.

JADON, S. S., TIWARI, R., SHARMA, H. & BANSAL, J. C. 2017. Hybrid artificial bee colony algorithm with differential evolution. Applied Soft Computing, 58, 11-24.

KAREEM, S. & OKUR, M. 2019a. Bayesian network structure learning based on pigeon inspired optimization.

KAREEM, S. & OKUR, M. C. Evaluation Of Bayesian Network Structure Learning. 2nd International Mediterranean Science and Engineering Congress (IMSEC 2017), Adana, TURKEY, 2017.

KAREEM, S. & OKUR, M. C. 2018. Bayesian Network Structure Learning Using Hybrid Bee Optimization and Greedy Search. Adana, Turkey: Çukurova University.

KAREEM, S. W. & MATHEMATICS 2020. Secure Cloud Approach Based on Okamoto-Uchiyama Cryptosystem. Journal of Applied Computer Science, 14.

KAREEM, S. W. & OKUR, M. C. 2019b. Pigeon inspired optimization of bayesian network structure learning and a comparative evaluation. Journal of Cognitive Science, 20, 535-552.

KAREEM, S. W. & OKUR, M. C. 2020a. Evaluation of Bayesian Network Structure Learning Using Elephant Swarm Water Search Algorithm. Handbook of Research on Advancements of Swarm Intelligence Algorithms for Solving Real-World Problems. IGI Global.

KAREEM, S. W. & OKUR, M. C. 2020b. Structure learning of Bayesian networks using elephant swarm water search algorithm. International Journal of Swarm Intelligence Research, 11, 19-30.

KAREEM, S. W., YOUSIF, R. Z., ABDALWAHID, S. M. J. & SCIENCE, C. 2020. An approach for enhancing data confidentiality in hadoop. Indonesian Journal of Electrical Engineering, 20, 1547-1555.

KAVEH, A. & TALATAHARI, S. 2010. A novel heuristic optimization method: charged system search. Acta Mechanica, 213, 267-289.

KOZA, J. R. & KOZA, J. R. 1992. Genetic programming: on the programming of computers by means of natural selection, MIT press.

LAZAR, A. 2002. Heuristic knowledge discovery for archaeological data using genetic algorithms and rough sets. Heuristic and optimization for knowledge discovery. IGI Global.

LIDBE, A. D., HAINEN, A. M. & JONES, S. L. 2017. Comparative study of simulated annealing, tabu search, and the genetic algorithm for calibration of the microsimulation model. Simulation

93, 21-33.

LIU, Y., ZHOU, H., WANG, Y., REN, X. & DIAO, X. 2019. Ant colony optimisation algorithm for multiobjective subset selection problems. Electronics Letters, 55, 1283-1286.

MA, H., SIMON, D., FEI, M. & CHEN, Z. 2013. On the equivalences and differences of evolutionary algorithms. Engineering Applications of Artificial Intelligence, 26, 2397-2407.

MITCHELL, M. 1998. An introduction to genetic algorithms, MIT press.

MLADENOVIĆ, N., HANSEN, P. & RESEARCH, O. 1997. Variable neighborhood search. Computers, 24, 1097-1100.

MOHAMMED, A. S., KAREEM, S. W., AL AZZAWI, A., SIVARAM, M. & CONTROL SYSTEMS, P. 2018. Time series prediction using SRE-NAR and SRE-ADALINE. Journal of Advanced Research in Dynamical, 1716-1726.

MOSCATO, P. 1989. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech concurrent computation program, C3P Report, 826, 1989.

OSMAN, I. H. Metaheuristics: models, design and analysis. Proceedings of the fifth Asia-Pacific Industrial Engineering and Management Systems Conference 2004, & the seventh Asia-Pacific division meeting, of the International Foundation of Production Research, Edited by Erhan, 2004. Citeseer.

OTUBAMOWO, K., EGUNJOBI, T. & ADEWOLE, A. 2012. A comparative study of simulated annealing and genetic algorithm for solving the travelling salesman problem.

PETALAS, Y. G., PARSOPOULOS, K. E. & VRAHATIS, M. N. 2007. Memetic particle swarm optimization. Annals of operations research, 156, 99-127.

PUCHINGER, J. & RAIDL, G. R. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. International work-conference on the interplay between natural and artificial computation, 2005. Springer, 41-53.

SAID, G. A. E.-N. A., MAHMOUD, A. M. & EL-HORBATY, E.-S. M. 2014. A comparative study of metaheuristic algorithms for solving quadratic assignment problem. arXiv preprint arXiv:.

SIVANANDAM, S. & DEEPA, S. 2007. Introduction to genetic algorithms: Springer Science & Business Media.

SONG, P.-C., PAN, J.-S. & CHU, S.-C. 2020. A parallel compact cuckoo search algorithm for three-dimensional path planning. Applied Soft Computing, 94, 106443.

SÖRENSEN, K., GLOVER, F. & SCIENCE, M. 2013. Metaheuristics. Encyclopedia of operations research, 62, 960-970.

WANG, F., ZHANG, H., LI, K., LIN, Z., YANG, J. & SHEN, X.-L. 2018. A hybrid particle swarm optimization algorithm using adaptive learning strategy. Information Sciences, 436, 162-177.

WANG, H., WANG, W., ZHOU, X., SUN, H., ZHAO, J., YU, X. & CUI, Z. 2017. Firefly algorithm with neighborhood attraction. Information Sciences, 382, 374-387.

YOUSIF, R. Z., KAREEM, S. W. & ABDALWAHID, S. M. 2020. Enhancing Approach for Information Security in Hadoop. Polytechnic Journal, 10, 81-87.



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.