
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Albrecht, S.k. Cheung, K.c. Hui, K.s. Leung, C.k. Wong, "Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case," IEEE Transactions on Computers, vol. 46, no. 8, pp. 905929, August, 1997.  
BibTex  x  
@article{ 10.1109/12.609279, author = {A. Albrecht and S.k. Cheung and K.c. Hui and K.s. Leung and C.k. Wong}, title = {Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {8}, issn = {00189340}, year = {1997}, pages = {905929}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.609279}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case IS  8 SN  00189340 SP905 EP929 EPD  905929 A1  A. Albrecht, A1  S.k. Cheung, A1  K.c. Hui, A1  K.s. Leung, A1  C.k. Wong, PY  1997 KW  Combinatorial optimization KW  placement problems KW  stochastic algorithms KW  simulated annealing KW  composite materials. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—This paper is a continuation of the first part, where we 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 us to obtain tight bounds for the annealing parameters which result in
[1] E.H.L. Aarts and J.H.M. Korst, Simulated Annealing and Boltzmann Machines. John Wiley&Sons, 1989.
[2] A. Albrecht, S.K. Cheung, K.C. Hui, K.S. Leung, and C.K. Wong, "Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case," IEEE Trans. Computers, vol. 46, no. 8, pp. 890904, Aug. 1997.
[3] ASM Int'l, ASM Engineered Materials Reference Book. ASM Int'l Reference Publications, 1989.
[4] Simulated Annealing : Parallelization Techniques R. Azencott, ed. John Wiley&Sons, 1992.
[5] M.R. Garey, D.J. Johnson, and L. Stockmeyer, "Some Simplified NPComplete Graph Problems," Theoretical Computer Science, vol. 1, pp. 237267, 1976.
[6] B. Hajek, "Cooling Schedules for Optimal Annealing," Mathematics of Operations Research, vol. 13, pp. 311329, 1988.
[7] M. Jünger, A. Martin, G. Reinelt, and R. Weismantel, "Quadratic 0/1 Optimization and a Decomposition Approach for the Placement of Electronic Circuits," Mathematical Programming, vol. 63, pp. 257279, 1994.
[8] S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, pp. 671680, May 1983.
[9] P.J.M. Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications. D. Reidel Publishing, 1987.
[10] K.G. Murty and S.N. Kabadi, "Some NPComplete Problems in Quadratic and Nonlinear Programming," Mathematical Programming, vol. 39, pp. 117129, 1987.
[11] F. Romeo and A. SangiovanniVincentelli, "A Theoretical Framework for Simulated Annealing," Algorithmica, vol. 6, no. 3, pp. 302345, 1991.
[12] C. Sechen and A. SangiovanniVincentelli, "The TimberWolf Placement and Routing Package," IEEE J. SolidState Circuits, vol. 20, no. 3, pp. 510522, Apr. 1985.
[13] W. Swartz and C. Sechen, "Time Driven Placement for Large Standard Cell Circuits," Proc. 32nd Design Automation Conf., pp. 211215, 1995.
[14] M. Jerrum and A. Sinclair, "Polynomial Time Approximations for the Ising Model," SIAM J. Computing, Vol. 22, No. 5, Oct. 1993, pp. 10871116.
[15] G. Sorkin, "Efficient Simulated Annealing on Fractal Energy Landscapes," Algorithmica, vol. 6, pp. 367418, 1991.
[16] S.A. Vavasis, "On Approximation Algorithms for Concave Quadratic Programming," Recent Advances in Global Optimization, C.A. Floudas and P.M. Pardalos, eds., pp. 318, 1992.
[17] I.M. Ward, Mechanical Properties of Solid Polymers. John Wiley&Sons, 1985.
[18] D.F. Wong and C.L. Liu, "Floorplan Design of VLSI Circuits," Algorithmica, vol. 4, pp. 263291, 1989.