Using simulated annealing to solve np-complete problems

الملخص EN

Simulated annealing algorithm is a recent powerful technique for solvinghard problems.

furthe rmore, if has a very interesting features: generalapplicability.

in fact, it has been used successfully for solving many np-complete problems.

this paper describes elementary theoretical concepts and principles of.

this technique and presents.

as well, some examples with results in witch simulated annealing algorithm is used to solve hard problems