Sample-sort simulated annealing

Authors:
D. R. Thompson;G. L. Bilbro
Affiliations:
Comput. Sci. & Comput. Eng. Dept., Univ. of Arkansas, Fayetteville, AR, USA;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2005

Citing 0
Cited 4

DESA: a new hybrid global optimization method and its application to analog integrated circuit sizing

Journal of Global Optimization
Coupled simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Maximum likelihood DOA estimation in distributed wireless sensor network using adaptive particle swarm optimization

Proceedings of the 2011 International Conference on Communication, Computing & Security
A simulated annealing method based on a specialised evolutionary algorithm

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simulated annealing (SA) algorithm called Sample-Sort that is artificially extended across an array of samplers is proposed. The sequence of temperatures for a serial SA algorithm is replaced with an array of samplers operating at static temperatures and the single stochastic sampler is replaced with a set of samplers. The set of samplers uses a biased generator to sample the same distribution of a serial SA algorithm to maintain the same convergence property. Sample-Sort was compared to SA by applying both to a set of global optimization problems and found to be comparable if the number of iterations per sampler was sufficient. If the evaluation phase dominates the computational requirements, Sample-Sort could take advantage of parallel processing.