Simulated Annealing with Iterative Improvement

In this paper, we have compare the results from the classical simulated annealing algorithm (SA) with iterative improvement simulated annealing algorithm (IISA) as initial solution. The benchmark test is performing on three different combinatorial optimization problem traveling salesman problem, N-queen problem and cell placement problem. The characteristic of the cost function of different problem instance are presented. The numerical results are show that the modified scheme provide better results than the classical algorithm.