No abstract

An extended pattern search algorithm is introduced for efficient component layout optimization. The algorithm is applicable to general layout problems, where component geometry can be arbitrary, design goals can be multiple and spatial constraint satisfactions can be of different types. Extensions to pattern search are introduced to help the algorithm to converge to optimal solutions by escaping inferior local minima. The performance on all of the test problems shows that the algorithm runs one-to-two orders of magnitude faster than a robust simulated annealing-based algorithm for results with the same quality. The algorithm is further extended to solve a concurrent layout and routing problem, which demonstrates the ability of the algorithm to apply new pattern strategies in search and to include different objective functions in optimization. [S1050-0472(00)01901-2]

Automated synthesis of product layout has the potential of substantially reducing design cycle time while allowing for quick check of interference, clearance, scale and fit prior to the building of physical prototypes. The search for optimal positions and orientations of parts in the layout typically requires a huge number of iterations. An extended pattern search layout algorithm based on coordinate search was introduced in an earlier paper and shown quite effective over the previous state-of-the-art. Coordinate search is a simple and straightforward way of implementing the extended pattern search method in the layout problem. However, it is not taking advantage of the wide variety of heuristics admissible in pattern search methods for identifying promising search directions. By introducing various search patterns and exploring their effectiveness in the layout problem, the question of whether complex tactics can do better than the basic coordinate pattern search is addressed. This paper presents four different heuristics for generating pattern directions in the extended pattern search layout algorithm: the conjugate direction method, the modified gradient method, the rank ordering method, and the simplex method. These heuristics are utilized to identify promising search directions and update the set of pattern directions used in the algorithm over iterations. The performance of the different heuristics is compared to that of the basic coordinate extended pattern search layout approach.

An extended pattern search algorithm is presented for the placement of shapeable components within a product layout. Shapeable octrees are used to evaluate the amount of overlap between pairs of components, extending previous technology that requires fixed-size components. The method is used to conceptualize the layout of the cross-section of an automatic transmission.

A pattern search-based algorithm is introduced for efficient component layout optimization. The algorithm is applicable to general layout problems, where component geometry can be arbitrary, design goals can be multiple and spatial constraint satisfactions can be of different types. Extensions to pattern search are introduced to help the algorithm to converge to optimal solutions by escaping inferior local minima. The performance on all of the test problems shows that the algorithm runs one-to-two orders of magnitude faster than a robust simulated annealing-based algorithm for results with the same quality. The algorithm is further extended to solve a concurrent layout and routing problem, which demonstrates the ability of the algorithm to apply new pattern strategies in search and to include different objective functions in optimization.