6. A total of nM Markov chains are run. A percentage of the variables (np) aremodified by a small random movement. 7. The solution is evaluated. Only feasible solutions whose probabilities are greater than a random number between 0 and 1 are accepted