Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing | IEEE Conference Publication | IEEE Xplore

Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing


Abstract:

Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is t...Show More

Abstract:

Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is the long computational time of the numerical annealings, and the solution to it is the parallel processing of SA. The other one is the determination of the appropriate temperature schedule in SA, and the solution to it is the introduction of an adaptive mechanism for changing the temperature. The multiple SA processes are performed in multiple processors, and the temperatures in the SA processes are determined by genetic algorithm. The proposed method is applied to solve many TSPs (travelling salesman problems) and JSPs (jobshop scheduling problems), and it is found that the method is very useful and effective.
Date of Conference: 08-12 December 2003
Date Added to IEEE Xplore: 24 May 2004
Print ISBN:0-7803-7804-0
Conference Location: Canberra, ACT, Australia

References

References is not available for this document.