English 中文(简体)
霸权主义与美德主义之间有何区别?
原标题:What is the difference between heuristics and metaheuristics?

After some research about algorithms I found two terms which confuses me. I ve read at least 20 papers and yet, there aren t any clear definition about either. I hope someone can help me tell the difference between heuristics and metaheuristics algorithms. And if possible, add the source of it.

ps:我已经知道这些词的含义,但我不知道这些词在计算机科学上究竟有什么区别。

预先感谢

最佳回答

你们可以想像一个问题的大致(而不是近似)解决办法。 粗略和近似的区别是,首先要找到解决问题的良好想法,但你并不真正知道这个问题是多么好。 第二是找到一种解决办法,你可以证明,解决办法如何接近最佳解决办法。

因此,犹豫不决往往取决于问题,也就是说,你对某个问题界定了犹豫。 元论是依赖问题的技术,可以应用于广泛的问题。 例如,湿度是选择在Quicksort省 p的随机元素。 一位神职人员对将适用的问题没有任何了解,可以把职能作为黑箱处理。

你们可以说,霸权主义利用依赖问题的信息,找到一个解决具体问题的好办法,而经济学家则像设计模式一样,是可适用于广泛问题的一般算法思想。

问题回答

为了提供恰当的引证,与亚历杭德罗的答复相对应:

« A metaheuristic is a high-level problem-independent algorithmic framework that provides a set of guidelines or strategies to develop heuristic optimization algorithms [...] A problem-specific implementation of a heuristic optimization algorithm according to the guidelines expressed in a metaheuristic framework is also referred to as a metaheuristic » (Sörensen, Glover on http://scholarpedia.org/article/Metaheuristics)

全面完成。 我们应当区分准确、近似和湿度算法。 确切算法找到了准确的解决办法。 大约算法应在可接受的时间内找到一个大致的解决办法,并表明其与假定最佳解决办法的差异范围。 一位温和分子在可接受的时间内,只是找到一个经过良好思考的解决办法。

By the way, Alejandro quicksort s example does not appear fully adequate for two or three different reasons.

  1. In fact, heuristics and metaheuristics are part of optimization s field. The problem they try to tackle is therefore of searching an optimum, not of sorting.
  2. Heuristics are generally use when the problems you want to tackle is too complex, in the computational sense - which is not the case of sorting problem.
  3. What was pointed at through the quicksort example, if I understand it well, is the random element. In principle, you can have deterministic heuristics - I never encountered a deterministic metaheuristics, but probably one could code it. It might be a bit "playing with words" but, the random element more properly characterizes "stochastic search" than (meta)heuristics.

详细解释,见:

Sörensen, K. (2015)。 元气——甲状腺暴露。 国际业务研究交易,22(1), 3-18.

A metaheuristic is a high-level problem-independent algorithmic framework that provides a set of guidelines or strategies to develop heuristic optimization algorithms. The term is also used to refer to a problem-specific implementation of a heuristic optimization algorithm according to the guidelines expressed in such a framework (Sörensen, 2015).

The heuristics are the guidelines, metaheurstics is the framework that uses those.





相关问题
What are the differences between NP, NP-Complete and NP-Hard?

What are the differences between NP, NP-Complete and NP-Hard? I am aware of many resources all over the web. I d like to read your explanations, and the reason is they might be different from what s ...

Implementation Detail for Graph Analysis Algorithms

Let s say I have a graph with "heavy" nodes, that is each node is an object that is already carrying a lot of data. I want to do a graph transformation that requires me to calculate a special ...

Worst case running time (Big O)

I have this question, and I don t know how to solve it, because I don t understand it. :( The question is: Programs A and B are analyzed and are found to have worst case running times no ...

RSA cryptosystem

Hi i am trying to set up an RSA cryptosystem i have all the values except d selected prime numbers: p=1889, q=2003, n=3783667, phi=3779776, e= 61 i got stuck finding d could anyone help me to figure ...

BNF Grammar Derivation

I want to apply rules of BNF Grammar to produce derivation for : a_Num

热门标签