Performance of a new annealing schedule

  • Authors:
  • Jimmy Lam;Jean-Marc Delosme

  • Affiliations:
  • Department of Computer Science, Yale University, New Haven, CT;Department of Electrical Engineering, Yale University, New Haven, CT

  • Venue:
  • DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new simulated annealing schedule has been developed; its application to the standard cell placement and the traveling salesman problems results in a two to twenty-four times speedup over annealing schedules currently available in the literature. Since it uses only statistical quantities, the annealing schedule is applicable to general combinatorial optimization problems.