Year: 2015
Type: article
Abstract: — 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.
Authors: Sachin Desale, Akhtar Rasool, Sushil Andhale, Priti Rane
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2511498629
