By Topic

Simulated annealing method for clustering problem in large-scale systems

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

3 Author(s)
Park, C.-I. ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Kyu Ho Park ; Kim, Myunghwan

The clustering problem in large-scale systems is known to be NP-complete. The authors present an algorithm based on an iterative improvement mechanism by using the method of simulated annealing with two types of perturbations: B-move and C-move. In all test cases, their algorithm shows improved results compared to previous methods. For a real circuit example with 95 vertices and 177 edges, the algorithm produces the solution of four clusters and three bottleneck vertices while the algorithm of A. Sangiovanni-Vincentelli et al. (1977) produces the solution of five clusters and six bottleneck vertices.<>

Published in:

Circuits and Systems, 1988., IEEE International Symposium on

Date of Conference:

7-9 June 1988