Using a Genetic Algorithm to Generate D‐optimal Designs for Mixture Experiments

We propose and develop a genetic algorithm (GA) for generating D‐optimal designs where the experimental region is an irregularly shaped polyhedral region. Our approach does not require selection of points from a user‐defined candidate set of mixtures and allows movement through a continuous region that includes highly constrained mixture regions. This approach is useful in situations where extreme vertices (EV) designs or conventional exchange algorithms fail to find a near‐optimal design. For illustration, examples with three and four components are presented with comparisons of our GA designs with those obtained using EV designs and exchange‐point algorithms over an irregularly shaped polyhedral region. The results show that the designs produced by the GA perform better than, if not as well as, the designs produced by the exchange‐point algorithms; however, the designs produced by the GA perform better than the designs produced by the EV. This suggests that GA is an alternative approach for constructing the D‐optimal designs in problems of mixture experiments when EV designs or exchange‐point algorithms are insufficient. Copyright © 2012 John Wiley & Sons, Ltd.     

Gearbox design for uncertain load requirements using active robust optimization

Design and optimization of gear transmissions have been intensively studied, but surprisingly the robustness of the resulting optimal design to uncertain loads has never been considered. Active Robust (AR) optimization is a methodology to design products that attain robustness to uncertain or changing environmental conditions through adaptation. In this study the AR methodology is utilized to optimize the number of transmissions, as well as their gearing ratios, for an uncertain load demand. The problem is formulated as a bi-objective optimization problem where the objectives are to satisfy the load demand in the most energy efficient manner and to minimize production cost. The results show that this approach can find a set of robust designs, revealing a trade-off between energy efficiency and production cost. This can serve as a useful decision-making tool for the gearbox design process, as well as for other applications.     

Design optimization using multiple dominance relations

A challenge in engineering design is to choose suitable objectives and constraints from many quantities of interest, while ensuring an optimization is both meaningful and computationally tractable. We propose an optimization formulation that can take account of more quantities of interest than existing formulations, without reducing the tractability of the problem. This formulation searches for designs that are optimal with respect to a binary relation within the set of designs that are optimal with respect to another binary relation. We then propose a method of finding such designs in a single optimization by defining an overall ranking function to use in optimizers, reducing the cost required to solve this formulation. In a design under uncertainty problem, our method obtains the most robust design that is not stochastically dominated faster than a multiobjective optimization. In a car suspension design problem, our method obtains superior designs according to a k-optimality condition than previously suggested multiobjective approaches to this problem. In an airfoil design problem, our method obtains designs closer to the true lift/drag Pareto front using the same computational budget as a multiobjective optimization.     

ASRSM: A Sequential Experimental Design for Response Surface Optimization

Most preset response surface methodology (RSM) designs offer ease of implementation and good performance over a wide range of process and design optimization applications. These designs often lack the ability to adapt the design on the basis of the characteristics of application and experimental space so as to reduce the number of experiments necessary. Hence, they are not cost‐effective for applications where the cost of experimentation is high or when the experimentation resources are limited. In this paper, we present an adaptive sequential response surface methodology (ASRSM) for industrial experiments with high experimentation cost, limited experimental resources, and high design optimization performance requirement. The proposed approach is a sequential adaptive experimentation approach that combines concepts from nonlinear optimization, design of experiments, and response surface optimization. The ASRSM uses the information gained from the previous experiments to design the subsequent experiment by simultaneously reducing the region of interest and identifying factor combinations for new experiments. Its major advantage is the experimentation efficiency such that for a given response target, it identifies the input factor combination (or containing region) in less number of experiments than the classical single‐shot RSM designs. Through extensive simulated experiments and real‐world case studies, we show that the proposed ASRSM method outperforms the popular central composite design method and compares favorably with optimal designs. Copyright © 2012 John Wiley & Sons, Ltd.     

A GA‐based technique for layout optimization of truss with stress and displacement constraints

Various developments of increasing complexity involved in layout optimization are discussed. The use of conventional GA in layout optimization is briefly mentioned with emphasis on its limitations and conditions imposed in finding the optimal design. The proposed new technique is applied to the benchmark example of Michell's truss for verification. The approach has also been applied to new examples of bridge truss and crane truss problems in order to demonstrate the generality and robustness for topology optimization. The approach is extended to include dual stress‐displacements constraints since many practical problems involve these two constraints simultaneously. Two‐bar and 10‐bar trusses are solved as examples for layout optimization with both stress and displacement constraints with satisfactory results. The effect of mutation on the final topology is also discussed. The major drawbacks of the ground structure approach are overcome in this proposed new method. The optimal designs obtained demonstrate the ability, robustness and generality of using the proposed new technique in layout optimization problems. Copyright © 2001 John Wiley & Sons, Ltd.     

Using a genetic algorithm to generate D‐optimal designs for mixture‐process variable experiments

This article presents and develops a genetic algorithm (GA) to generate D‐efficient designs for mixture‐process variable experiments. It is assumed the levels of a process variable are controlled during the process. The GA approach searches design points from a set of possible points over a continuous region and works without having a finite user‐defined candidate set. We compare the performance of designs generated by the GA with designs generated by two exchange algorithms (DETMAX and k‐exchange) in terms of D‐efficiencies and fraction of design space (FDS) plots which are used to evaluate a design's prediction variance properties. To illustrate the methodology, examples involving three and four mixture components and one process variable are proposed for creating the optimal designs. The results show that GA designs have superior prediction variance properties in comparison with the DETMAX and k‐exchange algorithm designs when the design space is the simplex or is a highly‐constrained subspace of the simplex.     

An Efficient Adaptive Sequential Methodology for Expensive Response Surface Optimization

The preset response surface methodology (RSM) designs are commonly used in a wide range of process and design optimization applications. Although they offer ease of implementation and good performance, they are not sufficiently adaptive to reduce the required number of experiments and thus are not cost effective for applications with high cost of experimentation. We propose an efficient adaptive sequential methodology based on optimal design and experiments ranking for response surface optimization (O‐ASRSM) for industrial experiments with high experimentation cost, limited experimental resources, and requiring high design optimization performance. The proposed approach combines the concepts from optimal design of experiments, nonlinear optimization, and RSM. By using the information gained from the previous experiments, O‐ASRSM designs the subsequent experiment by simultaneously reducing the region of interest and by identifying factor combinations for new experiments. Given a given response target, O‐ASRSM identifies the input factor combination in less number of experiments than the classical single‐shot RSM designs. We conducted extensive simulated experiments involving quadratic and nonlinear response functions. The results show that the O‐ASRSM method outperforms the popular central composite design, the Box–Behnken design, and the optimal designs and is competitive with other sequential response surface methods in the literature. Furthermore, results indicate that O‐ASRSM's performance is robust with respect to the increasing number of factors. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimal cost design of water distribution networks using a decomposition approach

Water distribution network decomposition, which is an engineering approach, is adopted to increase the efficiency of obtaining the optimal cost design of a water distribution network using an optimization algorithm. This study applied the source tracing tool in EPANET, which is a hydraulic and water quality analysis model, to the decomposition of a network to improve the efficiency of the optimal design process. The proposed approach was tested by carrying out the optimal cost design of two water distribution networks, and the results were compared with other optimal cost designs derived from previously proposed optimization algorithms. The proposed decomposition approach using the source tracing technique enables the efficient decomposition of an actual large-scale network, and the results can be combined with the optimal cost design process using an optimization algorithm. This proves that the final design in this study is better than those obtained with other previously proposed optimization algorithms.     

Soft computing approach for reliability optimization: State-of-the-art survey

In the broadest sense, reliability is a measure of performance of systems. As systems have grown more complex, the consequences of their unreliable behavior have become severe in terms of cost, effort, lives, etc., and the interest in assessing system reliability and the need for improving the reliability of products and systems have become very important. Most solution methods for reliability optimization assume that systems have redundancy components in series and/or parallel systems and alternative designs are available. Reliability optimization problems concentrate on optimal allocation of redundancy components and optimal selection of alternative designs to meet system requirement. In the past two decades, numerous reliability optimization techniques have been proposed. Generally, these techniques can be classified as linear programming, dynamic programming, integer programming, geometric programming, heuristic method, Lagrangean multiplier method and so on. A Genetic Algorithm (GA), as a soft computing approach, is a powerful tool for solving various reliability optimization problems. In this paper, we briefly survey GA-based approach for various reliability optimization problems, such as reliability optimization of redundant system, reliability optimization with alternative design, reliability optimization with time-dependent reliability, reliability optimization with interval coefficients, bicriteria reliability optimization, and reliability optimization with fuzzy goals. We also introduce the hybrid approaches for combining GA with fuzzy logic, neural network and other conventional search techniques. Finally, we have some experiments with an example of various reliability optimization problems using hybrid GA approach.     

Eliminating chromatic aberration in Gauss-type lens design using a novel genetic algorithm

Two different types of Gauss lens design, which effectively eliminate primary chromatic aberration, are presented using an efficient genetic algorithm (GA). The current GA has to deal with too many targets in optical global optimization so that the performance is not much improved. Generally speaking, achromatic aberrations have a great relationship with variable glass sets for all elements. For optics whose design is roughly convergent, glass sets for optics will play a significant role in axial and lateral color aberration. Therefore better results might be derived from the optimal process of eliminating achromatic aberration, which could be carried out by finding feasible glass sets in advance. As an alternative, we propose a new optimization process by using a GA and involving theories of geometrical optics in order to select the best optical glass combination. Two Gauss-type lens designs are employed in this research. First, a telephoto lens design is sensitive to axial aberration because of its long focal length, and second, a wide-angle Gauss design is complicated by lateral color aberration at the extreme corners because Gauss design is well known not to deal well with wide-angle problems. Without numbers of higher chief rays passing the element, it is difficult to correct lateral color aberration altogether for the Gauss design. The results and conclusions show that the attempts to eliminate primary chromatic aberrations were successful.     

A guided search genetic algorithm using mined rules for optimal affective product design

Affective design is an important aspect of new product development, especially for consumer products, to achieve a competitive edge in the marketplace. It can help companies to develop new products that can better satisfy the emotional needs of customers. However, product designers usually encounter difficulties in determining the optimal settings of the design attributes for affective design. In this article, a novel guided search genetic algorithm (GA) approach is proposed to determine the optimal design attribute settings for affective design. The optimization model formulated based on the proposed approach applied constraints and guided search operators, which were formulated based on mined rules, to guide the GA search and to achieve desirable solutions. A case study on the affective design of mobile phones was conducted to illustrate the proposed approach and validate its effectiveness. Validation tests were conducted, and the results show that the guided search GA approach outperforms the GA approach without the guided search strategy in terms of GA convergence and computational time. In addition, the guided search optimization model is capable of improving GA to generate good solutions for affective design.     

Constructing General Orthogonal Fractional Factorial Split-Plot Designs

While the orthogonal design of split-plot fractional factorial experiments has received much attention already, there are still major voids in the literature. First, designs with one or more factors acting at more than two levels have not yet been considered. Second, published work on nonregular fractional factorial split-plot designs was either based only on Plackett–Burman designs, or on small nonregular designs with limited numbers of factors. In this article, we present a novel approach to designing general orthogonal fractional factorial split-plot designs. One key feature of our approach is that it can be used to construct two-level designs as well as designs involving one or more factors with more than two levels. Moreover, the approach can be used to create two-level designs that match or outperform alternative designs in the literature, and to create two-level designs that cannot be constructed using existing methodology. Our new approach involves the use of integer linear programming and mixed integer linear programming, and, for large design problems, it combines integer linear programming with variable neighborhood search. We demonstrate the usefulness of our approach by constructing two-level split-plot designs of 16–96 runs, an 81-run three-level split-plot design, and a 48-run mixed-level split-plot design. Supplementary materials for this article are available online.     

基于双向渐进结构拓扑优化算法的创新设计研究

目的 在数字化设计的背景下,探索基于结构性能化的算法找形方法,运用双向渐进结构拓扑优化算法(Bi-Directional Evolutionary Structural Optimization,BESO)展开创新设计实践研究。方法 在理解双向渐进结构拓扑优化算法的基本内涵、相关理论、历史发展和现状应用的基础上,分析其算法生成的优势及可行性,并以算法的组织模式与生形原理为前提,对其进行几何划分、约束条件、优化技术、结构模拟、材料设定、迭代生形等内容协同一体的生成策略研究,提供了多元选择的设计机会。结果 得到了运用双向渐进结构拓扑优化算法进行的基于初始形态设计、拓扑优化设计和后处理与制造三步骤创新设计实践结果。结论 此设计实践方案验证了该算法生成方法的设计应用可行性,同时也为多领域应用该算法提供了新思路和新方向。     

Simultaneous topology,shape and size optimization of truss structures by fully stressed design based on evolution strategy

The most effective scheme of truss optimization considers the combined effect of topology, shape and size (TSS); however, most available studies on truss optimization by metaheuristics concentrated on one or two of the above aspects. The presence of diverse design variables and constraints in TSS optimization may account for such limited applicability of metaheuristics to this field. In this article, a recently proposed algorithm for simultaneous shape and size optimization, fully stressed design based on evolution strategy (FSD-ES), is enhanced to handle TSS optimization problems. FSD-ES combines advantages of the well-known deterministic approach of fully stressed design with potential global search of the state-of-the-art evolution strategy. A comparison of results demonstrates that the proposed optimizer reaches the same or similar solutions faster and/or is able to find lighter designs than those previously reported in the literature. Moreover, the proposed variant of FSD-ES requires no user-based tuning effort, which is desired in a practical application. The proposed methodology has been tested on a number of problems and is now ready to be applied to more complex TSS problems.     

Bi-directional evolutionary structural optimization for strut-and-tie modelling of three-dimensional structural concrete

This article presents a method for the automatic generation of optimal strut-and-tie models in reinforced concrete structures using a bi-directional evolutionary structural optimization method. The methodology presented is developed for compliance minimization relying on the Abaqus finite element software package. The proposed approach deals with the generation of truss-like designs in a three-dimensional environment, addressing the design of corbels and joints as well as bridge piers and pile caps. Several three-dimensional examples are provided to show the capabilities of the proposed framework in finding optimal strut-and-tie models in reinforced concrete structures and verifying its efficiency to cope with torsional actions. Several issues relating to the use of the topology optimization for strut-and-tie modelling of structural concrete, such as chequerboard patterns, mesh-dependency and multiple load cases, are studied. In the last example, a design procedure for detailing and dimensioning of the strut-and-tie models is given according to the American Concrete Institute (ACI) 318-08 provisions.     

Distributionally robust optimization for engineering design under uncertainty

This paper addresses the challenge of design optimization under uncertainty when the designer only has limited data to characterize uncertain variables. We demonstrate that the error incurred when estimating a probability distribution from limited data affects the out-of-sample performance (ie, performance under the true distribution) of optimized designs. We demonstrate how this can be mitigated by reformulating the engineering design problem as a distributionally robust optimization (DRO) problem. We present computationally efficient algorithms for solving the resulting DRO problem. The performance of the DRO approach is explored in a practical setting by applying it to an acoustic horn design problem. The DRO approach is compared against traditional approaches to optimization under uncertainty, namely, sample-average approximation and multiobjective optimization incorporating a risk reduction objective. In contrast with the multiobjective approach, the proposed DRO approach does not use an explicit risk reduction objective but rather specifies a so-called ambiguity set of possible distributions and optimizes against the worst-case distribution in this set. Our results show that the DRO designs, in some cases, significantly outperform those designs found using the sample-average or the multiobjective approach.     

Measurement Uncertainty: Methods and Applications

We consider the problem of determining an optimal experimental design for estimation of parameters of a class of complex curves characterizing nanowire growth that is partially exponential and partially linear. Locally D-optimal designs for some of the models belonging to this class are obtained by using a geometric approach. Further, a Bayesian sequential algorithm is proposed for obtaining D-optimal designs for models with a closed-form solution, and for obtaining efficient designs in situations where theoretical results cannot be obtained. The advantages of the proposed algorithm over traditional approaches adopted in recently reported nanoexperiments are demonstrated using Monte Carlo simulations. The computer code implementing the sequential algorithm is available as supplementary materials.     

On the valuation of goods and selection of the best design alternative

A platform is the set of elements and interfaces that are common to a family of products. In this paper, the design of a platform-based product family is formulated as an optimization problem. This optimization is then transformed into a two-step process amenable to industrial product design processes. The first step involves designing the technical aspects of the product family, optimizing an objective (or a set of objectives) subject to technical constraints, with external uncertain factors fixed. We have previously presented such a method for designing product families based on platforms that optimizes performance and cost metrics, using variables and a system model. That approach allows a team of engineers to design and evaluate candidate platforms, given perfect understanding of the designs and requirements. The second step is to quantify the value to the firm for each identified design alternative, while here accounting for external uncertain factors of the product family development. In this paper we present a model to perform this second step of the overall approach. Real options concepts are introduced to model the risks and delayed decision benefits present during product development due to uncertainty in technologies, funding, etc. We develop a quantitative measure of the value to the company for different family designs, and apply it to select the most appropriate design from the possible alternatives. An application to the design of platform-based families of spacecraft is shown. Electronic Publication     

Hybrid GA and SA dynamic set-up planning optimization

Set-up planning is used to determine the set-up of a workpiece with a certain orientation and fixturing on a worktable, as well as the number and sequence of set-ups and operations performed in each set-up. This paper presents a concurrent constraint planning methodology and a hybrid genetic algorithm (GA) and simulated annealing (SA) approach for set-up planning, and re-set-up planning in a dynamic workshop environment. The proposed approach and optimization methodology analyses the precedence relationships among features to generate a precedence relationship matrix (PRM). Based on the PRM and inquiry results from a dynamic workshop resource database, the hybrid GA and SA approach, which adopts the feature-based representation, optimizes the set-up plan using six cost indices. The PRM acts as the main constraints for the set-up planning optimization. Case studies show that the hybrid GA and SA approach is able to generate optimal results as well as carry out re-set-up planning on the occurrence of workshop resource changes.     

Multidisciplinary design and optimization of an air launched satellite launch vehicle using a hybrid heuristic search algorithm

A multidisciplinary design and optimization strategy for a multistage air launched satellite launch vehicle comprising of a solid propulsion system to low earth orbit with the implementation of a hybrid heuristic search algorithm is proposed in this article. The proposed approach integrated the search properties of a genetic algorithm and simulated annealing, thus achieving an optimal solution while satisfying the design objectives and performance constraints. The genetic algorithm identified the feasible region of solutions and simulated annealing exploited the identified feasible region in search of optimality. The proposed methodology coupled with design space reduction allows the designer to explore promising regions of optimality. Modules for mass properties, propulsion characteristics, aerodynamics, and flight dynamics are integrated to produce a high-fidelity model of the vehicle. The objective of this article is to develop a design strategy that more efficiently and effectively facilitates multidisciplinary design analysis and optimization for an air launched satellite launch vehicle.