Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Heuristic and Meta-Heuristic Algorithms and Their Relevance to the Real World: A Survey

Sachin Desale, Akhtar Rasool, Sushil Andhale, Priti Rane,


Nowadays computers are also used to solve incredibly complex problems. To solve these problems we have to develop some advanced algorithms. Exact algorithms of such problems might need unacceptably huge time & space to discover the solutions. For making the solution-finding algorithms acceptable approximation algorithms have been developed. These approximation algorithms use the heuristics and meta- heuristics functions to find out the solutions. Heuristic algorithms use the special designed functions to find out solution space intelligently. Meta-heuristics algorithms are the iterative generation process which guides a subordinate heuristic for exploring and exploiting the search space. Learning strategies in meta-heuristics helps to find efficient near-optimal solutions. Meta-heuristic algorithms make the complex problems solvable in acceptable time. This survey paper is trying to explain heuristic and Meta-heuristic techniques to solve the complex problems.

Sachin Desale,Akhtar Rasool,Sushil Andhale,Priti Rane."Heuristic and Meta-Heuristic Algorithms and Their Relevance to the Real World: A Survey". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 05,pp.296-304, May - 2015, URL :,

Keywords : Heuristics, Meta-heuristic, genetic algorithm(GA), tabu search(TS), simulated annealing(SA), Local search, Evolutionary Algorithms, Migrating Birds Optimization(MBO), Particle Swarm optimization(PSO), Artificial bee colony algorithm(ABC), Cuckoo search algorithm(CSA), Firefly algorithm(FA) , Harmony search(HS), Bat search algorithm(BSA).

[1] S. A. Cook. ”An overview of computational complexity”, in Communication of the ACM , vol. 26, no. 6, June 1983, pp.401408. 
[2] Natallia Kokash "An introduction to heuristic algorithms", ACSIJ-2014-3-5-560.
 [3] Blum, C., and Andrea R. “Meta-heuristics in Combinatorial Optimization: Overview and Conceptual Comparison”.ACM Computing Surveys, 35(3), 268–308, 2003. 
[4] Kirkpatrick, S., Gelatt. C. D., and Vecchi, M. P. “Optimization by simulated annealing”, Science, 13 May 1983 220, 4598, 671–680, 1983. 
[5] Osman, I.H., and Laporte,G. “Meta-heuristics:A bibliography”. Ann. Oper. Res. 63,513–623, 1996. 
[6] M. E. Aydin, T. C. Fogarty. ”A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimization Problems”, in Journal of Heuristics, vol. 24, no. 10, Mar. 2004, pp. 269–292. 
[7] R. Battiti. ”Reactive search: towards self-tuning heuristics”, in Modern heuristic search methods. Wiley&Sons, 1996, pp. 61- 83. 
[8] James Kennedy and Russell Eberhart, “Particle Swarm Optimization”,IEEE 1995. 
[9] B. Kr ̈ose, P. Smagt. An introduction to Neural Networks. University of Amsterdam, Nov. 1996. 
[10] D.Karaboga,D.Pham. Intelligent Optimisation Techniques:Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer Verlag, 2000. 
[11] Hansen, P. and Mladenović, N. An introduction to variable neighborhood search. In Meta-heuristics: Advances and trends in local search paradigms for optimization, S. Voß, S. Martello, I. Osman, and C. Roucairol, Eds. Kluwer Academic Publishers,Chapter 30, 433–458, 1999. 
[12] Natallia Kokash, Department of Informatics and Telecommunications, University of Trento, Italy “An introduction to heuristic algorithm”, 2006. 
[13] John Silberholz and Bruce Golden, "Comparison of Metaheuristic " Handbook of Meta-heuristic algorithm InternationalSeries in perations Research & Management Science Volume 146, pp 625-640,2010. 
[14] Bajeh, A. O. and Abolarinwa, K. O. , " Optimization: A Comparative Study of Genetic and Tabu Search Algorithms",International Journal of Computer Applications (IJCA), Volume 31–No.5, October 2011. 
[15] Marvin A. Arostegui Jr., Sukran N. Kadipasaoglu, and Basheer M. Khumawala, "An empirical comparison of Tabu Search,Simulated Annealing, and Genetic Algorithms for facilities location problems", International. Journal of Production Economics 103 (2006) 742–754, 2006.
[16] Mahdi Bashiri and Hossein Karimi, "Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons", Journal of Industrial Engineering International, 2012. 
[17] Gerald Paul,"Comparative performance of tabu search Assignment problem ", Operations Research Letters 38 (2010) 577–581, 2010. 
[18] Malti Baghel, Shikha Agrawa, and Sanjay Silakari Ph.D, "Survey of Meta-heuristic Algorithms for Combinatorial Optimization", International Journal of Computer Applications (0975 –8887) Volume 58–No.19, November-2011. 
[19] Beni, G., Wang, J. Swarm Intelligence in Cellular Robotic Systems, Proceed. NATO Advanced Workshop on Robots and Biological Systems, Tuscany, Italy, June 26–30 (1989). 
[20] M. Dorigo, Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italy, 1992. 
[21] Geem, Zong Woo (2010). "Research Commentary: Survival of the Fittest Algorithm or the Novelest Algorithm?". International Journal of Applied Meta-heuristic Computing 1 (4): 75–79. 
[22] Dechter, Rina, Morgan Kaufmann “hybrid search algorithmConstraint Processing” ISBN 1-55860-890-7, 2003. 
[23] D. Dervis Karaboga, An Idea Based On Honey Bee Swarm for Numerical Optimization, Technical Report-TR06,Erciyes University, Engineering Faculty, Computer Engineering Department 2005. 
[24] Xin-She-Yang “Nature-Inspired Meta-heuristic Algorithms.” Frome: Luniver Press. ISBN 1-905986-10-6, (2007). 
[25] M. Mahdavi et al., Fesanghary M, and Damangir E. ,“An_improved_harmony_search_algorithm_for_solving_optimi zation_problems”, 2007. 
[26] X.-S. Yang; S. Deb (December 2009). “Cuckoo search via Lévy flights.” World Congress on Nature & Biologically Inspired Computing (NaBIC 2009). IEEE Publications. pp. 210–214. 
[27] X.S. Yang, “A New Meta-heuristic Bat-Inspired Algorithm, in: Nature Inspired Cooperative Strategies for Optimization” (NISCO 2010) (Eds. J. R. Gonzalez et al.), Studies in Computational Intelligence, Springer Berlin, 284, Springer, 65-74 (2010). 
[28] Ekrem Duman, mital Uysal, Ali Fuat Alkaya, “Migrating Birds Optimization: A New Meta-heuristic Approach”, 2012. 
[29] Kennedy, J. and Eberhart, R. “Particle Swarm Optimization”, Proceedings of the 1995 IEEE International Conference on Neural Networks, pp. 1942-1948, IEEE Press, 199512. F. Divina, E. Marchiori. ”Handling Continuous Attributes in an Evolutionary Inductive Learner”, in IEEE Transactions on Evolutionary Computation, vol. 9, no.1, Feb. 2005, pp. 31–43. 
[30] M. Dorigo, V. Maniezzo & A. Colorni, 1996. "Ant System: Optimization by a Colony of Cooperating Agents", IEEE Transactions on Systems, Man, and Cybernetics–Part B,26, (1): 29-41.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal