Various Heuristic techniques used for problem solving : A Review
Keywords:
Algorithm, Heuristic, Tabu searchAbstract
A heuristic (to find) approach to a problem is an empirical search or optimization method that often works at solving the problem, but doesn't have any of the rigorous proof that people like physicists and mathematicians expect. Nobody knows if it will always give the best answer to the problem. To put it simply, it is a short cut to solving difficult problems. Optimization algorithms can be roughly divided into two categories: exact algorithms and heuristics. Exact algorithms are designed in such a way that it is guaranteed that they will find the optimal solution in a finite amount of time.
References
Siddique, N., & Adeli, H. (2015). Nature Inspired Computing: An Overview and Some Future Directions. Cognitive Computation, 7, 706–714.
http://doi.org/10.1007/s12559-015-9370-8
What are the differences between heuristics and metaheuristics?. Available from: https://www.researchgate.net/post/What_are_the_differences_between_heuristics_and_metaheuristics [accessed Sep 7, 2017].
An introduction to heuristic algorithms by Natallia Kokash http://www.ida.liu.se/~zebpe83/heuristic/
Stojanović, I., Brajević, I., Stanimirović, P. S., Kazakovtsev, L. A., & Zdravev, Z. (2017). Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs. Mathematical Problems in Engineering, 2017.
Kokash, Natallia. (2017). An introduction to heuristic algorithms. .
