\begin{algorithm}[t]\label{Algorithm 1}
\caption{چارچوب کلی الگوریتم (\lr{Simulated Annealing})}
\begin{latin}
\begin{algorithmic}[1]
      %\begin{flushleft}
          \STATE s ← s0; e ← E(s)                 // Initial state, energy.
\STATE    sbest ← s; ebest ← e             // Initial "best" solution.
\STATE     k ← 0                            // Energy evaluation count.
\STATE   while k < kmax and e > emax      // While time left , not good enought.
\STATE   T ← temperature(k/kmax)        // Temperature calculation.
  \STATE   snew ← neighbour(s)            // Pick some neighbour.
 \STATE    enew ← E(snew)                 // Compute its energy.  
  \STATE     if P(e, enew, T) > random() then  // Should we move to it?   
\STATE    s ← snew; e ← enew           // Yes, change state.   
    \STATE  if enew < ebest then           // Is this a new best?    
   \STATE  sbest ← snew; ebest ← enew   // Save 'new neighbour' to 'best' 
  \STATE   k ← k + 1                      // One more evaluation done.    
\STATE   return sbest                     // Return the best solution found.

\end{algorithmic}
\end{latin}
\end{algorithm}
در این بخش مسئله $-n $ وزیر را به دو روش پاسخ می دهیم که برنامه اول مربوط به کد متلب استفاده شده از الگوریتم 
(\ref{Algorithm 1})