By Topic

A very high speed architecture for simulated annealing

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

1 Author(s)
Abramson, D. ; Commonwealth Sci. & Ind. Res. Organ., Carlton, Vic., Australia

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.<>

Published in:

Computer  (Volume:25 ,  Issue: 5 )