By Topic

Parallel simulated annealing with adaptive neighborhood determined by GA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Miki, M. ; Knowledge Eng. Dept., Doshisha Univ., Kyoto, Japan ; Hiroyasu, T. ; Fushimi, T.

Simulated annealing (SA) is an effective general heuristic method for solving many optimization problems. This paper deals with the 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 neighborhood range in SA, and the solution to it is the introduction of an adaptive mechanism for changing the neighborhood range. The multiple SA processes are performed in multiple processors, and the neighborhood range in the SA processes are determined by a genetic algorithms. The proposed method is applied to solve many continuous optimization problems, and it is found that the method is very useful and effective.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:1 )

Date of Conference:

5-8 Oct. 2003