Quantified Relations: A Class of Predicate Logic Design Constraints Among Sets of Manufacturing, Operating, and Other Variations

1996 ◽  
Author(s):  
William W. Finch ◽  
Allen C. Ward
Keyword(s):  
Engineering Design ◽  
Predicate Logic ◽  
Operating Conditions ◽  
Causal Relationships ◽  
Engineering Systems ◽  
Multiple Sources ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Computing Effort ◽  
And Performance

Abstract This paper addresses a class of engineering design problems in which multiple sources of variations affect a product’s design, manufacture, and performance. Examples of these sources include uncertainty in nominal dimensions, variations in manufacture, changing environmental or operating conditions, and operator adjustments. Quantified relations (QR’s) are defined as a class of predicate logic expressions representing constraints between sets of design variations. Within QR’s, each variable’s quantifier and the order of quantification express a physical system’s causal relationships. This paper also presents an algorithm which propagates intervals through QR’s involving continuous, monotonic equations. Causal relationships between variables in engineering systems are discussed, and a tabular representation for them is presented. This work aims to broaden the application of automated constraint satisfaction algorithms, shortening design cycles for this class of problem by reducing modeling, and possibly computing effort. It seems to subsume Ward’s prior work on the Label Interval Calculus, extending the approach to a wider range of engineering design problems.

A Set-Based System for Eliminating Infeasible Designs in Engineering Problems Dominated by Uncertainty

1997 ◽  
Author(s):  
William W. Finch ◽  
Allen C. Ward
Keyword(s):  
Electronic Circuit ◽  
Predicate Logic ◽  
Software Tool ◽  
Design Parameters ◽  
Engineering Systems ◽  
Multiple Sources ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Engineering Problems ◽  
Prototype Software

Abstract This paper gives an overview of a system which eliminates infeasible designs from engineering design problems dominated by multiple sources of uncertainty. It outlines methods for representing constraints on sets of values for design parameters using quantified relations, a special class of predicate logic expressions which express some of the causal information inherent in engineering systems. The paper extends constraint satisfaction techniques and describes elimination algorithms that operate on quantified relations and catalogs of toleranced or adjustable parts. It demonstrates the utility of these tools on a simple electronic circuit, and describes their implementation and test in a prototype software tool.

An Overview of Inference Mechanisms for Quantified Relations

1998 ◽  
Author(s):  
William W. Finch
Keyword(s):  
Predicate Logic ◽  
Mathematical Treatment ◽  
Engineering Systems ◽  
Design Constraint ◽  
Design Problems ◽  
Interval Mathematics ◽  
New Class ◽  
Engineering Design Problems ◽  
Feasible Sets ◽  
And Performance

Abstract This paper temporarily sheds formal mathematical treatment and presents a more intuitive overview of inference mechanisms for quantified relations. These predicate logic expressions are a new class of design constraint among sets of variations affecting the design and performance of engineering systems. Simple examples illustrate the use of quantified relations to infer constraints on the membership of feasible sets. A small design problem from the electronics domain joins the mathematical tools with engineering concepts. A brief comparison demonstrates the advantages of this approach over conventional interval mathematics. This paper’s objective is to illustrate the application of quantified relations and their associated methods to engineering design problems.

Standards, Codes of Practice and Expert Systems

1988 ◽  
Vol 21 (1) ◽  
pp. 5-9 ◽  
Author(s):  
E G McCluskey ◽  
S Thompson ◽  
D M G McSherry
Keyword(s):  
Expert System ◽  
Expert Systems ◽  
Engineering Design ◽  
Performance Criteria ◽  
Design Problems ◽  
Codes Of Practice ◽  
Engineering Design Problems ◽  
And Performance

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.

scholarly journals SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems

Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 250 ◽  
Author(s):  
Umesh Balande ◽  
Deepti Shrimankar
Keyword(s):  
Constrained Optimization ◽  
Engineering Design ◽  
Real World ◽  
Optimization Design ◽  
Firefly Algorithm ◽  
Optimization Problems ◽  
Design Problems ◽  
Improved Firefly Algorithm ◽  
Engineering Design Problems ◽  
And Performance

Firefly-Algorithm (FA) is an eminent nature-inspired swarm-based technique for solving numerous real world global optimization problems. This paper presents an overview of the constraint handling techniques. It also includes a hybrid algorithm, namely the Stochastic Ranking with Improved Firefly Algorithm (SRIFA) for solving constrained real-world engineering optimization problems. The stochastic ranking approach is broadly used to maintain balance between penalty and fitness functions. FA is extensively used due to its faster convergence than other metaheuristic algorithms. The basic FA is modified by incorporating opposite-based learning and random-scale factor to improve the diversity and performance. Furthermore, SRIFA uses feasibility based rules to maintain balance between penalty and objective functions. SRIFA is experimented to optimize 24 CEC 2006 standard functions and five well-known engineering constrained-optimization design problems from the literature to evaluate and analyze the effectiveness of SRIFA. It can be seen that the overall computational results of SRIFA are better than those of the basic FA. Statistical outcomes of the SRIFA are significantly superior compared to the other evolutionary algorithms and engineering design problems in its performance, quality and efficiency.

Preferences and Correlated Uncertainties in Engineering Design

2003 ◽  
Author(s):  
Tomonori Honda ◽  
Erik K. Antonsson
Keyword(s):  
Engineering Design ◽  
Design Variable ◽  
Design Space ◽  
Design Method ◽  
Design Problems ◽  
Performance Variables ◽  
Design Variables ◽  
Engineering Design Problems ◽  
Engineering Problems ◽  
And Performance

The Method of Imprecision (MOI) is a multi-objective design method that maximizes the overall degree of both design and performance preferences. Sets of design variables are iteratively selected, and the corresponding performances are approximately computed. The designer’s judgment (expressed as preferences) are combined (aggregated) with the customer’s preferences, to determine the overall preference for sets of points in the design space. In addition to degrees of preference for values of the design and performance variables, engineering design problems also typically include uncertainties caused by uncontrolled variations, for example, measuring and fabrication limitations. This paper illustrates the computation of expected preference for cases where the uncertainties are uncorrelated, and also where the uncertainties are correlated. The result is a “best” set of design variable values for engineering problems, where the overall aggregated preference is maximized. As is illustrated by the examples shown here, where both preferences and uncontrolled variations are present, the presence of uncertainties can have an important effect on the choice of the overall best set of design variable values.

Biologically Inspired Design: A Macrocognitive Account

2010 ◽  
Author(s):  
Swaroop S. Vattam ◽  
Michael Helms ◽  
Ashok K. Goel
Keyword(s):  
Biological Sciences ◽  
Information Processing ◽  
Engineering Design ◽  
Design Patterns ◽  
Information Processing Model ◽  
Biologically Inspired ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Other Information ◽  
Biologically Inspired Design

Biologically inspired engineering design is an approach to design that espouses the adaptation of functions and mechanisms in biological sciences to solve engineering design problems. We have conducted an in situ study of designers engaged in biologically inspired design. Based on this study we develop here a macrocognitive information-processing model of biologically inspired design. We also compare and contrast the model with other information-processing models of analogical design such as TRIZ, case-based design, and design patterns.

scholarly journals Lévy-Flight Moth-Flame Algorithm for Function Optimization and Engineering Design Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Zhiming Li ◽  
Yongquan Zhou ◽  
Sen Zhang ◽  
Junmin Song
Keyword(s):  
Engineering Design ◽  
Function Optimization ◽  
Superior Performance ◽  
Local Optimum ◽  
Lévy Flight ◽  
Design Problems ◽  
Levy Flight ◽  
Spiral Path ◽  
Straight Line ◽  
Engineering Design Problems

The moth-flame optimization (MFO) algorithm is a novel nature-inspired heuristic paradigm. The main inspiration of this algorithm is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a spiral path around artificial lights. Aiming at the phenomenon that MFO algorithm has slow convergence and low precision, an improved version of MFO algorithm based on Lévy-flight strategy, which is named as LMFO, is proposed. Lévy-flight can increase the diversity of the population against premature convergence and make the algorithm jump out of local optimum more effectively. This approach is helpful to obtain a better trade-off between exploration and exploitation ability of MFO, thus, which can make LMFO faster and more robust than MFO. And a comparison with ABC, BA, GGSA, DA, PSOGSA, and MFO on 19 unconstrained benchmark functions and 2 constrained engineering design problems is tested. These results demonstrate the superior performance of LMFO.

Sign in / Sign up

Export Citation Format

Share Document