DocumentCode
2567540
Title
Simulated Annealing with Iterative Improvement
Author
Dirakkhunakon, Sipang ; Suansook, Yoothana
Author_Institution
Sripatum Univ., Bangkok, Thailand
fYear
2009
fDate
15-17 May 2009
Firstpage
302
Lastpage
306
Abstract
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.
Keywords
iterative methods; simulated annealing; travelling salesman problems; N-queen problem; cell placement problem; cost function; iterative improvement; simulated annealing; traveling salesman problem; Computational modeling; Cooling; Cost function; Iterative algorithms; Processor scheduling; Scheduling algorithm; Signal processing algorithms; Simulated annealing; Temperature; Traveling salesman problems; Cell Placement Problem; Combinatorial Optimization; Simulated Annealing; Traveling Salesman Problem; component;
fLanguage
English
Publisher
ieee
Conference_Titel
2009 International Conference on Signal Processing Systems
Conference_Location
Singapore
Print_ISBN
978-0-7695-3654-5
Type
conf
DOI
10.1109/ICSPS.2009.61
Filename
5166796
Link To Document