Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case

For pt.I see ibid., p.890-904. The paper is a continuation of the first part, where the authors considered regular arrangements of flexible objects for the unbounded case. The present part deals with a simulated annealing algorithm maximizing the number of flexible objects in equilibrium placements within rigid boundaries. The forces caused by the boundary are taken into account, i.e., the bounded case of placements is considered. The simulated annealing procedure makes use of the special structure of the underlying configuration space and relationships between deformations of flexible objects and resulting forces. This allows one to obtain tight bounds for the annealing parameters which result in n/sup 3/2//spl middot/In/sup 5/2/ and n/spl middot/In/sup 2/n time bounds, respectively, for the computation of equilibrium states by two different cooling schedules. The deformation/force formula is derived from a physical model of flexible discs and is based on numerical experiments which were performed for different materials and different sizes of objects. The algorithm was first implemented and tested for the unbounded case. The run-time is relatively short, even for large numbers of placed discs. These results are compared to the analytical ones obtained for regular placements in the first part of the paper, and agreement between these two sets of results are observed. Furthermore, several experiments for placements with boundary conditions were carried out and the resulting placements clearly show the effect of the forces from the rigid boundary.

[1]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[2]  Carl Sechen,et al.  Timing Driven Placement for Large Standard Cell Circuits , 1995, 32nd Design Automation Conference.

[3]  Chak-Kuen Wong,et al.  Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case , 1997, IEEE Trans. Computers.

[4]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[5]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[6]  P. R. Pinnock,et al.  The mechanical properties of solid polymers , 1966 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[9]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[10]  Michael Jünger,et al.  Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits , 1994, Math. Program..

[11]  S. Vavasis On approximation algorithms for concave quadratic programming , 1992 .

[12]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[13]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.