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

2004 ◽  
Vol 126 (1) ◽  
pp. 22-28 ◽  
Author(s):  
Su Yin ◽  
Jonathan Cagan

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.

Author(s):  
Su Yin ◽  
Jonathan Cagan

Abstract 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 one-to-two orders of magnitude improvement in speed over a robust simulated annealing-based layout algorithm. Coordinate search is a simple and straightforward way of implementing the 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, we will address the question of whether complex tactics can do better than the basic coordinate pattern search. We present in this paper 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 pattern search layout approach.


2004 ◽  
Vol 126 (1) ◽  
pp. 188-191 ◽  
Author(s):  
Su Yin ◽  
Jonathan Cagan ◽  
Peter Hodges

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.


2012 ◽  
Vol 134 (8) ◽  
Author(s):  
Bryony L. Du Pont ◽  
Jonathan Cagan

An extended pattern search approach is presented for the optimization of the placement of wind turbines on a wind farm. Problem-specific extensions infuse stochastic characteristics into the deterministic pattern search, inhibiting convergence on local optima and yielding better results than pattern search alone. The optimal layout for a wind farm is considered here to be one that maximizes the power generation of the farm while minimizing the farm cost. To estimate the power output, an established wake model is used to account for the aerodynamic effects of turbine blades on downstream wind speed, as the oncoming wind speed for any turbine is proportional to the amount of power the turbine can produce. As turbines on a wind farm are in close proximity, the interaction of turbulent wakes developed by the turbines can have a significant effect on the power development capability of the farm. The farm cost is estimated using an accepted simplified model that is a function of the number of turbines. The algorithm develops a two-dimensional layout for a given number of turbines, performing local turbine movement while applying global evaluation. Three test cases are presented: (a) constant, unidirectional wind, (b) constant, multidirectional wind, and (c) varying, multidirectional wind. The purpose of this work is to explore the ability of an extended pattern search (EPS) algorithm to solve the wind farm layout problem, as EPS has been shown to be particularly effective in solving multimodal layout problems. It is also intended to show that the inclusion of extensions into the algorithm can better inform the search than algorithms that have been previously presented in the literature. Resulting layouts created by this extended pattern search algorithm develop more power than previously explored algorithms using the same evaluation models and objective functions. In addition, the algorithm’s resulting layouts motivate a heuristic that aids in the manual development of the best layout found to date. The results of this work validate the application of an extended pattern search algorithm to the wind farm layout problem, and that its performance is enhanced by the use of problem-specific extensions that aid in developing results that are superior to those developed by previous algorithms.


Author(s):  
Su Yin ◽  
Jonathan Cagan ◽  
Peter Hodges ◽  
Xianren Li

Abstract An extended pattern search algorithm is presented for the placement of shapeable components within a product layout. The algorithm is applied to an automobile transmission layout taking into account the shapeability of the components. Overlap between components is allowed and penalized during the optimization process. Shapeable octrees are used to evaluate the amount of overlap between pairs of components. The algorithm minimizes the connection cost in addition to optimizing the position and size of the components. A shapeable component has a defined geometry, but its size may vary within limits. The size of clutches in a transmission is determined by the torque capacity requirement, thermal requirement, and gain requirement. Under a given load, the size of a clutch satisfying a set of functional requirements is related to its location in the transmission assembly, making it necessary to design the clutches on the fly while laying out the components.


Author(s):  
Caitlin Forinash ◽  
Bryony DuPont

An Extended Pattern Search (EPS) method is developed to optimize the layout and turbine geometry for offshore floating wind power systems. The EPS combines a deterministic pattern search with stochastic extensions. Three advanced models are incorporated: (1) a cost model considering investment and lifetime costs of a floating offshore wind farm comprised of WindFloat platforms; (2) a wake propagation and interaction model able to determine the reduced wind speeds downstream of rotating blades; and (3) a power model to determine power produced at each rotor, and includes a semi-continuous, discrete turbine geometry selection to optimize the rotor radius and hub height of individual turbines. The objective function maximizes profit by minimizing cost, minimizing wake interactions, and maximizing power production. A multidirectional, multiple wind speed case is modeled which is representative of real wind site conditions. Layouts are optimized within a square solution space for optimal positioning and turbine geometry for farms containing a varying number of turbines. Resulting layouts are presented; optimized layouts are biased towards dominant wind directions. Preliminary results will inform developers of best practices to include in the design and installation of offshore floating wind farms, and of the resulting cost and power production of wind farms that are computationally optimized for realistic wind conditions.


Author(s):  
Caitlin Forinash ◽  
Bryony DuPont

An Extended Pattern Search (EPS) approach is developed for offshore floating wind farm layout optimization while considering challenges such as high cost and harsh ocean environments. This multi-level optimization method minimizes the costs of installation and operations and maintenance, and maximizes power development in a unidirectional wind case by selecting the size and position of turbines. The EPS combines a deterministic pattern search algorithm with three stochastic extensions to avoid local optima. The EPS has been successfully applied to onshore wind farm optimization and enables the inclusion of advanced modeling as new technologies for floating offshore wind farms emerge. Three advanced models are incorporated into this work: (1) a cost model developed specifically for this work, (2) a power development model that selects hub height and rotor radius to optimize power production, and (3) a wake propagation and interaction model that determines aerodynamic effects. Preliminary results indicate the differences between proposed optimal offshore wind farm layouts and those developed by similar methods for onshore wind farms. The objective of this work is to maximize profit; given similar parameters, offshore wind farms are suggested to have approximately 24% more turbines than onshore farms of the same area. EPS layouts are also compared to those of an Adapted GA; 100% efficiency is found for layouts containing twice as many turbines as the layout presented by the Adapted GA. Best practices are derived that can be employed by offshore wind farm developers to improve the layout of platforms, and may contribute to reducing barriers to implementation, enabling developers and policy makers to have a clearer understanding of the resulting cost and power production of computationally optimized farms; however, the unidirectional wind case used in this work limits the representation of optimized layouts at real wind sites. Since there are currently no multi-turbine floating offshore wind farm projects operational in the United States, it is anticipated that this work will be used by developers when planning array layouts for future offshore floating wind farms.


VLSI Design ◽  
1994 ◽  
Vol 2 (3) ◽  
pp. 241-257 ◽  
Author(s):  
Chi-Yu Mao ◽  
Yu Hen Hu

In this paper, we present a Simulated Evolution Gate Matrix layout Algorithm (SEGMA) for synthesizing CMOS random logic modules. The gate-matrix layout problem is solved as a one-dimensional transistor gates placement problem. Given a placement of all the transistor gates, simulated evolution offers a systematic method to improve the quality of the layout that is measured by the number of tracks needed for the given netlist. This is accomplished by identifying a subset of gates whose relative placements are deemed “poor quality” according to a heuristic criterion. By rearranging the placement of these identified subsets of gates, it is hoped that a gate placement with better quality, meaning fewer tracks, may emerge. Since this method enables the current “generation” of gate placement to evolve into a more advanced one in a way similar to the biological evolution process, this method is called simulated evolution. To apply simulated evolution to solve the gate-matrix layout problem, we propose a novel heuristic criterion, called randomized quality factor, which facilitates the judicious selection of the subset of poor quality gates. Several carefully devised and tested strategies are also implemented. Extensive simulation results indicate that SEGMA is producing very compact gate-matrix layouts.


Author(s):  
Chandankumar Aladahalli ◽  
Jonathan Cagan ◽  
Kenji Shimada

This paper introduces the Sensitivity-based Pattern Search (SPS) algorithm for 3D component layout. Although based on the pattern search algorithm, SPS differs in that at any given step size the algorithm does not necessarily perturb the search space along all possible search dimensions. Instead all possible perturbations, or moves are ranked in decreasing order of their effect on the objective function and are applied in that order. The philosophy behind this algorithm is that moves that affect the objective function more must be applied before the moves that affect the objective function less. We call this effect on the objective function the sensitivity of the objective function to a particular move and present a simple method to quantify it. This algorithm performs better than the previous Extended Pattern Search algorithm with decrease in run time of up to 28%.


Sign in / Sign up

Export Citation Format

Share Document