simulated_annealing_pseudocode

# Pseudocode for Simulated Annealing Algorithm

while t_new > stopping temp:
     for number of runs at each temp:
          x_new, y_new = random neighboring value of x_old, y_old
          calculate the cost c_new of this neighboring solution
          if   c_new – c_old >= 0:
               This is a better solution, so move to it
          else:
               Calculate the probability of moving to the new worse solution
               Probability moving  =  𝑒^((𝑐_𝑛𝑒𝑤  − 𝑐_𝑜𝑙𝑑)/𝑡_𝑛𝑒𝑤 )
   t_new = t_new * cooling_rate