Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms

Evolutionary Computation (1993) 1 (4): 361–383.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Asynchronous simulated annealing on the placement problem: A beneficial race condition

Mark Vousden
Graeme M. Bragg
Andrew D. Brown

Journal of Parallel and Distributed Computing (2022) 169: 242.

Application of Simulated Annealing in Various Field

C Venkateswaran
M Ramachandran
Ramu Kurinjimalar
Prasanth Vidhya
G Mathivanan

Materials and its Characterization (2022) 1 (1): 01.

Parallel simulated annealing using an adaptive resampling interval

Zhihao Lou
John Reinitz

Parallel Computing (2016) 53: 23.

Markov Chain Analysis of Agent-based Evolutionary Computing in Dynamic Optimization

Aleksander Byrski
Robert Schaefer

Procedia Computer Science (2013) 18: 1475.

Nonlinear optimization with a massively parallel Evolution Strategy–Pattern Search algorithm on graphics hardware

Weihang Zhu

Applied Soft Computing (2011) 11 (2): 1770.

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Hui Cheng
Xingwei Wang
Shengxiang Yang
Min Huang

Applied Soft Computing (2009) 9 (2): 677.

On the robustness of population-based versus point-based optimization in the presence of noise

V. Nissen
J. Propach

IEEE Transactions on Evolutionary Computation (1998) 2 (3): 107.