Using Simulated Annealing to Solve NP- Complete Problems

Authors

  • Abdul-Rahman H.Al-Husaini
  • S.K.Majeed
  • M.Abdullah

Keywords:

Simulated annealing, Np-Complete, heuristic, algorithms

Abstract

Simulated annealing algorithm is a recent powerful technique for solving hard problems. Furthermore, if has a very interesting features: general applicability. In fact, it has been used successfully for solving many NP-complete problem.
This paper describes elementary theoretical concepts and principles of this technique and presents. As well, some examples with results in which simulated annealing algorithm is used to solve hard problems .

Downloads

Published

01/22/2023

Issue

Vol. 8 No. 1 (2005): Vol08

Section

Articles

How to Cite

Using Simulated Annealing to Solve NP- Complete Problems. (2023). Al-Mansour Journal, 8(1), 28-54. https://journal.muc.edu.iq/journal/article/view/354