Heuristic strategies (heuristic)
It is a general term for a class in solving a specific problem within an acceptable time and space can give it a feasible solution, but do not guarantee to obtain the optimal solution strategy (and feasible solution to the deviation from the optimal solution) of . Many heuristic algorithm is quite special, depending on a particular issue. In the course of a heuristic search for the optimal solution in its search path can be changed according to the individual or global experience, when seeking the optimal solution of the problem becomes impossible or difficult to accomplish (eg NP-Complete problems), heuristic type strategy is an efficient way to obtain a feasible solution. This is a kind of "problem specific" strategy
Heuristic Algorithm (Heuristic Algorigthm) is an algorithm based on experience or intuition configuration, at an acceptable cost (time calculation means calculates space, etc.) gives a feasible solution to be solved optimization problem each instance, the feasible solution and the degree of deviation from the optimal solution is generally not expected beforehand.
Heuristics is a technique, this algorithm can find the best solution in the calculation of the cost acceptable, but does not necessarily guarantee the feasibility and optimality of the resulting solution, even in most cases can not be explained resulting solution approximate degree between the optimal solution.
Meta-heuristic strategies (metaheuristic) is different, meta-heuristic strategy is usually a common heuristic strategy, they usually some sort of problem without resorting to specific conditions, which can be applied to a wider range of aspects. Yuan heuristic search process will usually put forward some demands, heuristic algorithms and implemented in accordance with these requirements will be called meta-heuristics. Many meta-heuristic algorithms have made inspiration (eg simulated annealing, genetic algorithms) from some random natural phenomenon. Now an important research direction yuan heuristic search is to prevent premature local optimum too, many people have made the corresponding work, such as tabu search (tabu) and improved non-transfer (simulated annealing). This is a kind of "problem independent" strategy
Metaheuristic (MetaHeuristic Algorigthm) heuristic is improved, it is a random algorithm and partial product of the combination search algorithm, heuristic algorithm comprises a common genetic algorithms, simulated annealing, tabu search algorithms and neural networks.
New meta-heuristic algorithms, particle swarm optimization, differential evolution algorithm, ant colony optimization algorithm, firefly algorithm, cuckoo algorithm, harmony search algorithm, differential evolution algorithm, random leapfrog algorithm, bacterial foraging algorithm, bat algorithm the algorithm