Issue No. 05 - May (1992 vol. 25)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.144393
<p>A class of scheduling problems that can be modeled by using very simple cost measures, namely, counting costs and distance-measure costs, is presented. These measures can be incorporated into a simulated annealing algorithm, providing a robust system for solving such scheduling problems. A special-purpose computer architecture that supports the simulated annealing of such problems is described. This architecture provides speeds greatly surpassing those of conventional workstations and supercomputers using the same algorithm.</p>
D. Abramson, "A Very High Speed Architecture for Simulated Annealing," in Computer, vol. 25, no. , pp. 27-36, 1992.