Science Fair Project Encyclopedia
Meta heuristic
A meta heuristic is an algorithmic approach to approximate optimal solutions for problems in combinatorial optimization.
The name meta heuristic stems from the composition of two Greek words. Heuristic derives from the verb heuriskein (ευρισκειν) which means "to find" and the prefix meta means "beyond, in an upper level".
Common meta heuristics are local search, simulated annealing, tabu search, genetic algorithms and ant systems . Many variants and hybrids of these techniques exist and can be applied in various real world applications.
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details