Research Article
Production Scheduling and Customer Orders Assignment in a Three-Level Supply Chain
Algorithm 2
The sod code of simulated annealing algorithm.
| Procedure: Simulated annealing Algorithm | | Generate a random initial solution () | | While the stopping criterion is not met (the maximum allowed CPU time) | | Generate a test solution from a current solution via mutation () | | If Tardiness() ≤ Tardiness() | | (replace current solution with test solution) | | Else check metropolis Criterion | | Rand = Generate a random number between 0 and 1 | | If Rand < P(A) | | (replace current solution with test solution) | | End if | | End if | | End while | | Report as the best solution |
|
