0
TECHNICAL PAPERS

Exploring the Effectiveness of Various Patterns in an Extended Pattern Search Layout Algorithm

[+] Author and Article Information
Su Yin

General Electric Corporate R&D, K1-2A68, P.O. Box 8, Schenectady, NY 12301e-mail: yinsu@crd.ge.com

Jonathan Cagan

Department of Mechanical Engineering, Carnegie Mellon University, Pittsburgh, PA 15213e-mail: cagan@cmu.edu

J. Mech. Des 126(1), 22-28 (Mar 11, 2004) (7 pages) doi:10.1115/1.1641185 History: Received October 01, 2000; Revised June 01, 2003; Online March 11, 2004
Copyright © 2004 by ASME
Your Session has timed out. Please sign back in to continue.

References

De Bont,  F. M. J., Aarts,  E. H. L., Meehan,  P., and O’Brien,  C. G., 1988, “Placement of Shapeable Blocks,” Philips J. Res., 43, pp. 1–22.
Sorkin, G., 1992, “Theory and Practice of Simulated Annealing on Special Energy Landscapes,” Ph.D Thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley.
Yin, S., and Cagan, J., 1998, “A Pattern Search-Based Algorithm for Three-Dimensional Component Layout,” Proceedings of the 24th ASME Design Automation Conference (DAC-5582), Atlanta, GA, September 13–16.
Yin,  S., and Cagan,  J., 2000, “An Extended Pattern Search Algorithm for Three-Dimensional Component Layout,” ASME J. Mech. Des., 122(1), pp. 102–108.
Huang, M. D., Romeo, F., and Sangiovanni-Vincentelli, A., 1986, “An Efficient General Cooling Schedule for Simulated Annealing,” ICCAD-86: IEEE International Conference on Computer Aided Design-Digest of Technical Papers, Santa Clara, CA, November 11–13, pp. 381–384.
Hustin, M. D., and Sangiovanni-Vincentelli, A., 1987, “TIM, a New Standard Cell Placement Program Based on the Simulated Annealing Algorithm,” IEEE Physical Design Workshop on Placement and Floorplanning.
Dowsland,  K. A., and Dowsland,  W. B., 1992, “Packing Problems,” European Journal of Operational Research, 56, pp. 2–14.
Landon,  M. D., and Balling,  R. J., 1994, “Optimal Packaging of Complex Parametric Solids According to Mass Property Criteria,” ASME J. Mech. Des., 116, pp. 375–381.
Kim,  J. J., and Gossard,  D. C., 1991, “Reasoning on the Location of Components for Assembly Packaging,” ASME J. Mech. Des., 113, pp. 402–407.
Wodziack, J., and Fadel, G. M., 1996, “Bi-Objective Optimization of Components Packing Using a Genetic Algorithm,” AIAA-96-4022-CP pp. 352–362, Paper presented at NASA/AIAA/ISSMO Multidisciplinary Design and Optimization Conference, Seattle, WA.
Kirkpatrick,  S., Gelatt,  C. D., and Vecchi,  M. P., 1983, “Optimization by Simulated Annealing,” Science, 220(4598), pp. 671–679.
Sechen, C., 1988, VLSI Placement and Global Routing Using Simulated Annealing, Kluwer Academic Publishers, Boston.
Wong, D. F., Leong, H. W., and Liu, C. L., 1988, Simulated Annealing for VLSI Design, Kluwer Academic Publishers, Boston.
Szykman,  S., and Cagan,  J., 1995, “A Simulated Annealing Approach to Three-Dimensional Component Packing,” ASME J. Mech. Des., 117(2A), pp. 308–314.
Szykman,  S., and Cagan,  J., 1996, “Synthesis of Optimal Non-Orthogonal Routes,” ASME J. Mech. Des., 118(3), pp. 419–424.
Szykman,  S., and Cagan,  J., 1997, “Constrained Three Dimensional Component Layout Using Simulated Annealing,” ASME J. Mech. Des., 119(1), pp. 28–35.
Szykman,  S., Cagan,  J., and Weisser,  P., 1998, “An Integrated Approach to Optimal Three Dimensional Layout and Routing,” ASME J. Mech. Des., 120(3), pp. 510–512.
Kolli, A., Cagan, J., and Rutenbar, R. A., 1996, “Packing of Generic, Three Dimensional Components Based on Multi-Resolution Modeling,” Proceedings of the 22nd ASME Design Automation Conference (DAC-1479), Irvine, CA, August 19–22.
Smith,  N., Hills,  W., and Cleland,  G., 1996, “A Layout Design System for Complex Made-to-Order Products,” J. Eng. Design, 7(4), pp. 363–375.
Cagan,  J., Degentesh,  D., and Yin,  S., 1998, “A Simulated Annealing-Based Algorithm Using Hierarchical Models for General Three-Dimensional Component Layout,” Comput.-Aided Des., 30(10), pp. 781–790.
Hooke,  R., and Jeeves,  T. A., 1961, “Direct Search Solution of Numerical and Statistical Problems,” J. Assoc. Comput. Mach., 8(2), pp. 212–229.
Torczon, V., and Trosset, M., 1997, “From Evolutionary Operation to Parallel Direct Search: Pattern Search Algorithms for Numerical Optimization,” Computing Science and Statistics, 29 .
Powell,  M. J. D., 1963, “An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives,” Comput. J., 7, pp. 155–162.
Fletcher,  R., and Reeves,  C. M., 1964, “Function Minimization by Conjugate Gradients,” Comput. J., 7(2), pp. 149–154.
Lewis, R. M., and Torczon, V., 1996, “Rank Ordering and Positive Bases in Pattern Search Algorithms,” TR 96-71, ICASE, NASA Langley Research Center, Hampton, VA 23681-0001.
Nelder,  J. A., and Mead,  R., 1965, “A Simplex Method for Function Minimization,” Comput. J., 7, pp. 308–313.

Figures

Grahic Jump Location
The basic pattern search method
Grahic Jump Location
The conjugate direction extended pattern search method
Grahic Jump Location
The conjugate gradient extended pattern search method
Grahic Jump Location
The rank ordering pattern search moves
Grahic Jump Location
The rank ordering extended pattern search method
Grahic Jump Location
The simplex extended pattern search moves
Grahic Jump Location
The simplex extended pattern search method
Grahic Jump Location
Sample solutions to the test problems

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In