Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Parallel data cubes on multi-core processors with multiple disks
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
Networks beat pipelines: the design of FG 2.0
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
Parallel suffix array construction for shared memory architectures
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
An efficient programming model for memory-intensive recursive algorithms using parallel disks
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
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.