Method of optimizing component layout using a pattern based sear

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364149, 36447413, G06F 300

Patent

active

059535172

ABSTRACT:
The present invention is directed to a method of, and apparatus for, solving a packing or layout problem by applying a pattern based search technique to an initial component configuration. By interactively working through a series of new or "then current" configurations, an optimal component configuration is determined based on a predetermined criterion. According to one embodiment of the invention, at least one perturbation is introduced during the course of the search. The perturbation may be introduced by swapping component positions, increasing move size, or any other activity which breaks or interrupts the pattern of a normal pattern based search.

REFERENCES:
patent: 5249133 (1993-09-01), Batra
patent: 5381343 (1995-01-01), Bamji et al.
patent: 5495419 (1996-02-01), Rostoker et al.
patent: 5513119 (1996-04-01), Moore et al.
patent: 5519628 (1996-05-01), Russell et al.
patent: 5557533 (1996-09-01), Koford et al.
patent: 5604680 (1997-02-01), Bamji et al.
patent: 5682322 (1997-10-01), Boyle et al.
Hooke, R., et al., "Direct Search Solution of Numerical and Statistical Problems", Journal of the Association for Computing Machinery, 8(2): 212-29, 1961.
Szykman, S., et al., "A Simulated Annealing-Based Approach to Three-Dimensional Component Packing," Transactions of the ASME, vol. 117, Jun. 1995, pp. 308-314.
Kolli, A., et al., "Packing of Generic, Three-Dimensional Components Based on Multi-Resolution Modeling," Proceedings of the 1996 ASME Design Engineering Technical Conferences and Computers in Engineering Conference, Aug. 18-22, 1996.
Szykman, S., et al., "Constrained Three-Dimensional Component Layout Using Simulated Annealing," Transactions of the ASME, vol. 119, Mar. 1997, pp. 28-35.
Virginia Torczon et al., From Evolutionary Operation To Parallel Direct Search: Pattern Search Algorithms For Numerical Optimization, Department of Computer Science, College of Williams & Mary, Williamsburg, VA.
Robert Michael Lewis et al., Pattern Search Algorithms For Bound Constrained Minimization, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA.
Robert Michael Lewis et al., Rank Ordering And Positive Bases In Pattern Search Algorithms, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA.
Virginia Torczon, On The Convergence Of Pattern Search Algorithms, Siam J. Optim., vol. 7, No. 1, pp. 1-25, Feb. 1997.
IEEE/ACM International Conference On Computer-Aided Design, Nov. 7, 1993, Santa Clara, CA, USA, pp. 164-169, Hyunchul Shin et al. A Combined Hierarchical Placement Algorithm.
Computer Aided Design, vol. 22, No. 2, Mar. 1990, London, GB, pp. 97-108, Montreuil, Requirements For Representation Of Domain Knowledge In Intelligent Environments For Layout Design.
M. D. Huang, et al., An Efficient General Cooling Schedule For Simulated Annealing, 1986, IEEE, pp. 281-284.
Simon Szykman, et al., Automated Generation of Optimally Directed Three Dimensional Component Layouts, pp. 527-537 DE-Vol. 65-1 Advances in Design Automation--vol. 1 ASME 1993.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method of optimizing component layout using a pattern based sear does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of optimizing component layout using a pattern based sear, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of optimizing component layout using a pattern based sear will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1518830

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.