A Unified Approach to Solving Graph Based Design Problems

Author(s):  
Matthew I. Campbell ◽  
Sandeep Nair ◽  
Jay Patel

This paper proposes a new perspective of using graph transformation systems as a way of organizing and solving engineering design problems. Using this novel technique the synthesis of optimal solutions in the form of graph topologies for design problems is made possible. Though the concept of graph grammars has existed for several decades in computer science literature, researchers in the field of design have now begun to realize the merit of using them to harness both the knowledge and heuristics of a particular problem domain. This paper examines the fundamental challenges in applying graph transformations in a design context. The paper also presents the first topology optimization method that has been developed specifically for domains representable by a graph grammar schema. This novel approach could also be used in several problems such as network problems (especially in determining the placement of hubs), electric circuit design, neural networks, sheet metal, and product architecture. The abstraction afforded by graphs also enables us to tackle multi-disciplinary problems found throughout engineering design. A few engineering examples are shown in this paper in order to illustrate the power of the approach in automating the design process.

Author(s):  
Kikuo Fujita ◽  
Noriyasu Hirokawa ◽  
Shinsuke Akagi ◽  
Shinji Kitamura ◽  
Hideaki Yokohata

Abstract A genetic algorithm based optimization method is proposed for a multi-objective design problem of an automotive engine, that includes several difficulties in practical engineering optimization problems. While various optimization techniques have been applied to engineering design problems, a class of realistic engineering design problems face on a mixture of different optimization difficulties, such as the rugged nature of system response, the numbers of design variables and objectives, etc. In order to overcome such a situation, this paper proposes a genetic algorithm based multi-objective optimization method, that introduces Pareto-optimality based fitness function, similarity based selection and direct real number crossover. This optimization method is also applied to the design problem of an automotive engine with the design criteria on a total power train. The computational examples show the ability of the proposed method for finding a relevant set of Pareto optima.


Author(s):  
Jay Patel ◽  
Matthew I. Campbell

This paper discusses a new topological optimization technique to solve graph based engineering design problems by decoupling parameters and topology changes. Using this approach optimal solutions are synthesized in the form of graph topologies for engineering problems. Currently we have successfully applied it to routing problems, resistive networks, neural networks, and sheet metal. This final problem has proven the most challenging but the results are not only novel and manufacturable but also satisfy multiple objective functions such as material cost and manufacturability. This paper presents Topological and Parametric Tune and Prune (TP2) as the first topology optimization method that has been developed specifically for domains representable by a graph grammar schema. The method is stochastic and incorporates distinct phases for modifying the topologies and modifying parameters stored within topologies. Thus far, with the problems that been tested, (TP2) had proven better than genetic algorithm in terms of the quality of solutions and time taken to acquire them.


Author(s):  
Subroto Gunawan ◽  
Panos Y. Papalambros

Engineering design problems frequently involve a mix of both continuous and discrete uncertainties. However, most methods in the literature deal with either continuous or discrete uncertainties, but not both. In particular, no method has yet addressed uncertainty for categorically discrete variables or parameters. This article develops an efficient optimization method for problems involving mixed continuous-discrete uncertainties. The method reduces the number of function evaluations performed by systematically filtering the discrete factorials used for estimating reliability based on their importance. This importance is assessed using the spatial distance from the feasible boundary and the probability of the discrete components. The method is demonstrated in examples and is shown to be very efficient with only small errors.


Author(s):  
D L Wei ◽  
Z S Cui ◽  
J Chen

Robust optimization is a probabilistic approach to engineering design under uncertainty. The main idea is to select designs insensitive to changes in given parameters. Robust optimization using numerical simulations for black-box problems has received increasing interest. However, when the simulation programmes are computationally expensive, robust optimization is difficult to implement due to the intensive computational demand of uncertainty propagation. Based on polynomial chaos expansion (PCE), an efficient robust optimization method is presented. The PCE is constructed with points of monomial cubature rules (MCRs) to approximate the original model. As the number of points of MCRs is small and all of the points are sampled, the robust optimization procedure is computationally efficient and stable. Two engineering design problems are employed to demonstrate the availability of the proposed method.


2006 ◽  
Vol 129 (2) ◽  
pp. 158-165 ◽  
Author(s):  
Subroto Gunawan ◽  
Panos Y. Papalambros

Engineering design problems frequently involve a mix of both continuous and discrete random variables and parameters. However, most methods in the literature deal with only the continuous or the discrete type, but not both. In particular, no method has yet addressed problems for which the random components (variables and∕or parameters) are categorically discrete. This paper develops an efficient optimization method for problems involving mixed continuous-discrete random variables and parameters. The method reduces the number of function evaluations performed by systematically filtering the discrete combinations used for estimating reliability based on their importance. This importance is assessed using the spatial distance from the feasible boundary and the probability of the discrete components. The method is demonstrated in examples and is shown to be very efficient with only small errors.


1988 ◽  
Vol 21 (1) ◽  
pp. 5-9 ◽  
Author(s):  
E G McCluskey ◽  
S Thompson ◽  
D M G McSherry

Many engineering design problems require reference to standards or codes of practice to ensure that acceptable safety and performance criteria are met. Extracting relevant data from such documents can, however, be a problem for the unfamiliar user. The use of expert systems to guide the retrieval of information from standards and codes of practice is proposed as a means of alleviating this problem. Following a brief introduction to expert system techniques, a tool developed by the authors for building expert system guides to standards and codes of practice is described. The steps involved in encoding the knowledge contained in an arbitrarily chosen standard are illustrated. Finally, a typical consultation illustrates the use of the expert system guide to the standard.


Sign in / Sign up

Export Citation Format

Share Document