Metaheuristic
Jump to navigation
Jump to search
A Metaheuristic is a heuristic that is domain independent.
References
2012
- http://en.wikipedia.org/wiki/Metaheuristic
- QUOTE: In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the problem being optimized and can search very large spaces of candidate solutions. However, metaheuristics do not guarantee an optimal solution is ever found. Many metaheuristics implement some form of stochastic optimization.
Other terms having a similar meaning as metaheuristic, are: derivative-free, direct search, black-box, or indeed just heuristic optimizer. Several books and survey papers have been published on the subject.
- QUOTE: In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the problem being optimized and can search very large spaces of candidate solutions. However, metaheuristics do not guarantee an optimal solution is ever found. Many metaheuristics implement some form of stochastic optimization.
2011
- (Dorigo & Birattari, 2011) ⇒ Marco Dorigo, and Mauro Birattari. (2011). “Metaheuristic.” In: (Sammut & Webb, 2011) p.662