By Topic

Hybrid Simulated Annealing Algorithm Based on the Parallel Strategy

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)
Su Hua ; Coll. of Astronaut., Northwestern Polytech. Univ., Xi''an, China ; Gu Liangxian ; Gong Chunlin

The traditional serial simulated annealing algorithm has low efficiency, and is high depending on the setup parameters. The author presents a new hybrid parallel simulated annealing algorithm based on multi-thread parallel computing. Algorithm generates a set of random initial points, and then calculates a number of Markov chains in parallel. Each Markov chain has its own setup parameter. At every parallel point, the groups of parallel Markov chains' solutions are used to set the current global optimization strategies which will overcome premature convergence and improve the ability of searching global optima. A local search algorithms-Powell algorithm is used when the parallel annealing algorithm is finished at the approximate optimal point to improve the algorithm accuracy, and get the improved global optimal solution. The results show that the hybrid parallel simulated annealing algorithm can deal with multimodal function more effectively.

Published in:

Computational Intelligence and Design (ISCID), 2010 International Symposium on  (Volume:2 )

Date of Conference:

29-31 Oct. 2010