|
In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem, especially with incomplete or imperfect information or limited computation capacity.〔 Metaheuristics sample a set of solutions which is too large to be completely sampled. Metaheuristics may make few assumptions about the optimization problem being solved, and so they may be usable for a variety of problems.〔 Compared to optimization algorithms and iterative methods, metaheuristics do not guarantee that a globally optimal solution can be found on some class of problems.〔 Many metaheuristics implement some form of stochastic optimization, so that the solution found is dependent on the set of random variables generated.〔 By searching over a large set of feasible solutions, metaheuristics can often find good solutions with less computational effort than optimization algorithms, iterative methods, or simple heuristics.〔 As such, they are useful approaches for optimization problems.〔 Several books and survey papers have been published on the subject.〔〔〔〔〔 Most literature on metaheuristics is experimental in nature, describing empirical results based on computer experiments with the algorithms. But some formal theoretical results are also available, often on convergence and the possibility of finding the global optimum.〔 Many metaheuristic methods have been published with claims of novelty and practical efficacy. Unfortunately, many of the publications have been of poor quality; flaws include vagueness, lack of conceptual elaboration, poor experiments, and ignorance of previous literature. The field also features high-quality research. ==Properties== These are properties that characterize most metaheuristics:〔 * Metaheuristics are strategies that guide the search process. * The goal is to efficiently explore the search space in order to find near–optimal solutions. * Techniques which constitute metaheuristic algorithms range from simple local search procedures to complex learning processes. * Metaheuristic algorithms are approximate and usually non-deterministic. * Metaheuristics are not problem-specific. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Metaheuristic」の詳細全文を読む スポンサード リンク
|