Advantages and disadvantages of genetic algorithm, numerical algorithm, mountain climbing algorithm and simulated annealing.

Genetic algorithm: the advantage is that it can deal with constraints well, jump out of local optimization well, and finally get the global optimal solution, with strong global search ability; The disadvantages are slow convergence speed, weak local search ability, long running time and easy to be influenced by parameters.

Simulated annealing: the advantages are strong local search ability and short running time; The disadvantage is that the global search ability is poor and it is easily influenced by parameters.

Mountain climbing algorithm: Obviously, the mountain climbing algorithm is simple and efficient, but it is not enough to deal with large-scale problems with multiple constraints, and often it can't get a better solution.

Numerical algorithm: The meaning of this numerical algorithm is too broad. What numerical algorithm are you talking about? The advantages and disadvantages of most array algorithms are similar to those of mountain climbing algorithms.

PS: hope to adopt!