IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2005 · 42 citations · 22 references
Memetic AlgorithmEngineeringSample-sort Simulated AnnealingSingle Stochastic SamplerSimulated AnnealingSorting AlgorithmComputer EngineeringComputer ScienceMonte Carlo SamplingParallel ComputingCombinatorial OptimizationSimulation OptimizationParallel MetaheuristicsSerial Sa Algorithm
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.
22
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44K citations
Numerical Analysis, Large-scale Global Optimization, Computational Science +15
Equation of State Calculations by Fast Computing Machines
N. Metropolis, Arianna W. Rosenbluth, M. N. Rosenbluth et al. · The Journal of Chemical Physics · 1953 · 36.5K citations
Monte Carlo sampling methods using Markov chains and their applications
W. Keith Hastings · Biometrika · 1970 · 14.9K citations
Cooling Schedules for Optimal Annealing
Bruce Hajek · Mathematics of Operations Research · 1988 · 1.2K citations