Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS

Similar documents
Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Ones Assignment Method for Solving Traveling Salesman Problem

IMP: Superposer Integrated Morphometrics Package Superposition Tool

Math 10C Long Range Plans

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

Consider the following population data for the state of California. Year Population

Improving Template Based Spike Detection

Alpha Individual Solutions MAΘ National Convention 2013

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

Operating System Concepts. Operating System Concepts

OCR Statistics 1. Working with data. Section 3: Measures of spread

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

condition w i B i S maximum u i

South Slave Divisional Education Council. Math 10C

Numerical Methods Lecture 6 - Curve Fitting Techniques

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Accuracy Improvement in Camera Calibration

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Pattern Recognition Systems Lab 1 Least Mean Squares

Image Segmentation EEE 508

New HSL Distance Based Colour Clustering Algorithm

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

3D Model Retrieval Method Based on Sample Prediction

Counting Regions in the Plane and More 1

Elementary Educational Computer

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Lecture 21: Variation Risk Management

The isoperimetric problem on the hypercube

Evaluation scheme for Tracking in AMI

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

The Magma Database file formats

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

Chapter 3 Classification of FFT Processor Algorithms

1 Enterprise Modeler

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

A SYSTEMATIC APPROACH FOR COST OPTIMAL TOLERANCE DESIGN

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

Cubic Polynomial Curves with a Shape Parameter

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Octahedral Graph Scaling

Parabolic Path to a Best Best-Fit Line:

Performance Plus Software Parameter Definitions

Fast Fourier Transform (FFT) Algorithms

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

Descriptive Statistics Summary Lists

Apparent Depth. B' l'

Lecture 18. Optimization in n dimensions

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

Math Section 2.2 Polynomial Functions

1. SWITCHING FUNDAMENTALS

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

How do we evaluate algorithms?

. Written in factored form it is easy to see that the roots are 2, 2, i,

Python Programming: An Introduction to Computer Science

EVALUATION OF TRIGONOMETRIC FUNCTIONS

NTH, GEOMETRIC, AND TELESCOPING TEST

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

How Reliable are the Ground Motion Prediction Equations?

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

Stone Images Retrieval Based on Color Histogram

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

The identification of key quality characteristics based on FAHP

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

Algorithm. Counting Sort Analysis of Algorithms

Package popkorn. R topics documented: February 20, Type Package

Avid Interplay Bundle

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

27 Refraction, Dispersion, Internal Reflection

Data Structures and Algorithms. Analysis of Algorithms

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Intro to Scientific Computing: Solutions

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.

Characterizing graphs of maximum principal ratio

Optimal Tolerance Allocation Based on Fuzzy Comprehensive Evaluation and Genetic Algorithm

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

Xbar/R Chart for x1-x3

Data diverse software fault tolerance techniques

Analysis of Algorithms

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Algorithms for Disk Covering Problems with the Most Points

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Transcription:

28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets of a assembly. The allotted tolerace has direct relatio with the maufacturig ad quality cost of the mechaical assembly. I this chapter, mathematical (aalytical) formulatio for simultaeous tolerace allocatio usig various methods like Worst Case Sceario (WCS), Root Sum Square (RSS) method, Spoot s Modified criteri a (SM) ad Estimated Mea Shift (EMS) criteria have bee explaied. Moreover, the importace of tolerace of positio cotrol is discussed i detail. 3.1 MATHEMATICAL FORMULATION OF THE PROBLEM The existig literature (Ye ad salustri, 2003) shows that maufacturig costs have bee icreased due to the allocatio of tight toleraces after employig quality loss ad tolerace sythesis methods. The cocurret tolerace allocatio method simultaeously assigs toleraces to strike balace betwee quality ad maufacturig cost ad optimizes cost over the life of the product. It is also importat to ote that positioal tolerace (Data, 2005) which is a geometric tolerace is also havig a impact o the total

29 cost of a assembly. I the preset thesis, the optimizatio of tolerace sythesis problem has bee solved after cosiderig both the maufacturig ad quality cost for various mechaical assemblies, such as, pisto-cylider, wheel-mout ad rotor-key. For rotor-key assembly, positioal cotrol is icorporated i the stackup coditios. By combiig maufacturig ad quality cost measures, this method tries to get equilibrium betwee them ad attai a miimal total cost (CT) of the assembly. I the preset model, process ad desig toleraces are cosidered to be the decisio variables. The maufacturig cost is a fuctio of process toleraces, whereas the quality loss is a fuctio of desig toleraces. Depedig o the miimizatio of total cost of assembly a optimizatio problem is formulated as follows. 3.2 FORMULATION AS AN OPTIMIZATION PROBLEM I this preset work, the objective fuctio cosidered miimizes the total cost (CT) i.e maufacturig ad quality cost of the assembly. I the objective fuctio, the weights W1 for maufacturig cost ad W2 for quality cost are icorporated. The Assumptios for Formulatig the Mathematical Model are give below: 1. The desig fuctio ca be retrieved ad formulated from a assembly cotext. This fuctio defies a relatioship betwee a set of deviatios i a dimesio chai ad a product performace

30 characteristic. I this work desig fuctio is assumed oedimesioal. 2. The resultat tolerace of a dimesio chai is give. This is the fuctioal tolerace, which comes from fuctioal or customer requiremets ad is available from the outset of a desig project. 3. A process pla for each dimesio is give. I a cocurret egieerig eviromet, it is commoplace to fid maufacturig egieers developig process plas while desigers are still detailig the product. Eve with icomplete or ureliable iformatio, a maufacturig egieer ca estimate a process pla. 4. Each process has a ormal distributio ad is uder statistical cotrol. This allows six-sigma theory to be applied. 5. The dimesios i a dimesio chai ad the processes for each dimesio are idepedet. below. The formulatio of the problem as optimizatio problem is give Mi. pi 2 C() T W 1 1 1 C tpij W 2 K i j y, (3.1) Subjected to: t T i 1 id f, worst case criteria (3.2) or 2 t i 1 id T f, RSS criteria (3.3) or

31 Z 1 2 2 tid tid Tf i 1 i 1 2 2 mitid (1) mi tid Tf i 1 3 i 1 Spotts criteria (3.4) or Estimated mea shift criteria (3.5) All the above costraits are used to optimize the objective fuctio without positio cotrol (that is, geometrical tolerace). The costraits with positio cotrol (Data, 2005) are give below. t 1 id T i f T positio worst case criteria (3.6) or 2 t i 1 id T f T positio RSS criteria (3.7) or 1 2 or 2 tid tid Tf Tpositio i 1 i 1 Spotts criteria (3.8) Z 2 2 mitid (1) mi tid Tf Tpositio i 1 3 i 1 Estimated mea shift criteria (3.9) ad ad ad t ij t i j 1 mi max ij ij ij Tp ij, (3.10) tp tp tp, (3.11) tp ipi t id, (3.12)

32 where the costrait equatios 3.2 to 3.9 represets the desig tolerace costraits for differet cases, whereas equatio 3.10 idicates the maufacturig tolerace costrait. Moreover, the equatios 3.11 ad 3.12 represet the process tolerace costraits ad desig toleraces costraits, respectively. The sigificace of the termiology used i the above equatios is give below. The total maufacturig cost of a assembly represets the summatio of the maufacturig costs of idividual machiig process for the etire compoet s dimesio. Table 3.1 shows a few cost fuctios proposed by Dog et al. (1991, 1994) which have a extra edge over the traditioal cost fuctios i modelig the maufacturig cost tolerace characteristics precisely. The expoetial cost fuctio model proposed by Spekhart (1972) has proved to be the best amog all. Table 3.1: Cost tolerace models Cost tolerace Model Combiatio of reciprocal powers Ad expoetial Combiatio of liear ad Expoetial fuctio B splie cost model Cubic polyomial model Fourth order polyomial model Fifth order polyomial model Mathematical Represetatio c C() t a b/ t dexp() et C() t a bt cexp() dt C()()()()()() t a B t a B t a B t a B t a B t 4 4 4 4 4 1 1 2 2 3 3 4 4 5 5 C() t a a t a t a t 2 3 0 1 2 3 C() t a a t a t a t a t 2 3 4 0 1 2 3 4 C() t a a t a t a t a t a t 2 3 4 5 0 1 2 3 4 5

33 A way to evaluate ecoomic loss from a quality deviatio elimiatig the eed to create the uique fuctio for every quality characteristic is provided by Taguchi quality loss fuctio (Taguchi, 1989). These losses comprise of customer satisfactio, performace, ad maufacturig ad supplier efficiecy. These are real i ature ad ca be estimated i moey terms. Figure 3.1 depicts Taguchi s Loss Fuctio ad is defied as follows: Moetary loss is a fuctio of each product feature (x), ad its differece from the best (target) value. Figure 3.1: Taguchi s Loss Fuctio ad ormal distributio x = measuremet of a compoet characteristic. T = X target value. a = extet of loss whe the quatity of x deviates from the quatity of T b = extet that x deviates from T. I this illustratio, T = mea of the sample of X s. The Nomial characteristic is pictorially depicted i the Figure 3.2. The loss ( L) icreases as the output value ( y) departs from the

34 target value ( m) risig the mea squared deviatio. No loss is show eve whe the output value equal the target value (y = m). Figure 3.2: Graphical represetatio of the Nomial Characteristic Quality loss is quatified, as a quadratic expressio represetig the loss to the deviatio of a product property L(Y) = k(y-m) 2, (3.13) where k=a/tf, A is the replacemet cost. Whe the dimesio does ot match the tolerace requiremets, Tf is the fuctioal tolerace requiremet, m is the fuctioal dimesio target value, ad y represets the desig characteristic. A ormal distributio havig the mea at the target value is assumed to be the fuctioal dimesio. The stadard deviatio of the fuctioal dimesio represets the quality loss. The loss fuctio the ca be give as follows QL = E(L(Y)) = k( (μ m) 2 +σy 2 ), (3.14) where µ is the mea ad σ 2 y is the variace of Y. The distace of the mea of Y i.e µ from the target value m ad the variace of Y are

35 liearly combied i the equatio. Durig parameter desig a quality egieer alters µ to reduce the quality loss. The value of process variability σy will ot be affected by these adjustmets. Fially the quality loss may be show as: QL = E(L(Y))= k σy 2, (3.15) Based o the desig fuctio, a set of idividual quality characteristics ca be used to estimate the overall quality characteristic. It is to be oted that Taylor s series expressios ca be used to foud these approximate fuctios. The idividual quality characteristic i terms of the resultat variace is expressed as fallows: 2 2 f 2 y i 1 x xi, (3.16) i Toleraces are i geeral related ad desiged i combiatio with the applicatio of a particular maufacturig process. The the process capability idex Cp, is writte as: t Cp id, (3.17) 3 xi The above expressio ca be modified as t id xi, (3.18) 3C pi Substitutig the Equatio 3.18 i Equatio 3.16

36 2 2 2 f t id y, (3.19) i 1 x i 3C p ad the total quality loss is 3.3 CONSTRAINTS 2 QL t d k y, (3.20) The optimizatio problem discussed above has costraits pertaiig to both desig ad maufacturig toleraces. 3.3.1 Desig Tolerace Costraits The fudametal cosideratios of various dimesios of the assembly are based o the desig tolerace. The desig tolerace costrait is formulated with a coditio that i the dimesioal chai, accumulated tolerace should ot go over the specified tolerace o the fuctioal dimesio. Several approaches had bee proposed to estimate the accumulated toleraces, which are valid uder variable coditios. I additio to regular stack up approaches, like RSS ad worst case (Paul, 1999), other otraditioal approaches, such as Spoot s criteria ad Estimated Mea Shift criteria have also bee used. The relatioships related to these cases are give i equatios 3.2 to 3.9. Worst case sceario (WCS): The ame worst case sceario implies that it adds or subtracts all the upper or lower toleraces coected with the omial set poit for idividual compoet. I this case, laws of probability are ot

37 cosidered ad it keeps the assembly at the highest or lowest possible dimesio. All the part dimesios are summed up at the worst case miimum or maximum tolerace values (paul, 1999). Based o the worst possible coditio, the simplest of all is the method of extremes (equatio 3.2). The outcome of this method allocates very precise toleraces, which i tur lead to higher maufacturig costs of a assembly Root Sum of Squares (RSS) method: RSS is a kid of statistical toleracig method. This method is helpful to take care of the rare case of all dimesios occurrig at their ed limits oe after the other. The said method is a mathematical treatmet method of the data to assist the tolerable additio of measures of variability. The mere assumptio cosidered i the Root-sum-square (RSS) criteria (Paul, 1999) (equatio 3.3) is a ormal process distributio with the mea cetered at the omial value. It is also called as simple statistical model ad depeds o impractical assumptio. The applicatio of this method yields low maufacturig cost of assembly due to very loose toleraces. Spotts Modified (SM) criteria: This method is used due to its simplicity. Some modificatios have bee proposed to accout for the realistic distributios of process. Based o mea results of WC ad RSS stack-up coditios, Spott s developed a ew method called Spotts modified (SM) criteria (Spott s, 1978). This model is represeted i equatio 3.4.

38 Estimated Mea Shift (EMS) Criteria: A itegrated approach where we ca cotrol the amout of mea shift is proposed by Greewood ad Chase (1987). It cotais the RSS ad the WC as the ed cases, ad it ca reproduce ay itermediate value. I this model, the rage of mea shift factor is cosidered as (0.0, 1.0) ad represets a amout by which the midpoit is estimated to shift, as a fractio of the tolerace rage. If a process is closely cotrolled, the a small value of mea shift, such as 0.25 is used. If the amout of iformatio kow about the process is less, a high value of mea shift factor is cosidered. If the value of mea shift factor is equal to 1.0 for all the compoets, it represets the Worst Case model ad if the mea shift factor is zero for all of the compoets, the approach is similar to Root Sum Square Model. I the preset study, the value of mea shift (m i) is to be cosidered to be 0.25 for close cotrol i all the cases. This model is represeted i equatio 3.5. Geometric Toleraces - Tolerace of Positio Cotrol: I geometric tolerace methods, tolerace of positio cotrol (TOP cotrol) is oe of the importat methods. It defies the locatio tolerace of a feature of size from its origial positio. There are two ways of specifyig the TOP cotrol boudary. The first method is to specify TOP tolerace zoe o RFS basis, where as the secod method employs either MMC or LMC. I both the methods, the FOS ceter plae should be i the idetified tolerace zoe of the cotrol frame.

39 Advatages of Tolerace of Positio: While comparig the Tolerace of Positio ad Coordiate Toleracig, the former is foud to have distict advatages over the latter. To ame a few, the advatages are: 1. TOP allows datum shift ad additioal toleraces-bous. 2. It gives 57% larger cylidrical tolerace zoes tha square zoes. 3. TOP gives protectio to the part fuctio. 4. Maufacturig costs are reduced. 5. Accumulatio of tolerace is reduced by TOP cotrol. TOP cotrols geerally employ cylidrical tolerace zoes. Figure 3.3 shows the coversio of a liear tolerace ito cylidrical tolerace zoe. It is importat to ote that a additioal tolerace of 57% will be gaied usig a cylidrical tolerace zoe. I additio to this, additioal toleraces of 50 to 100% are goig to be added i the form of bous ad datum shift, which leads to the lower maufacturig cost. Figure 3.3: Coversio of square zoe to cylidrical positioal tolerace zoe.

40 Trasformatio of square zoe ito cylidrical zoe: The true positio of a feature is described geerally by the positio tolerace, as it chooses a datum ad the omial locatio of a poit, a lie, or a plae of the feature. Let us cosider the positio tolerace to be x, the the correspodig liear dimesioal tolerace is give by dividig x with 2 2 (Yua, 1999). The expressio for this model usig GLi, (basic dimesio) ad GPTi (positioal tolerace) is i the followig form: GLi ± GPT i 2 2 3.3.2 Maufacturig Tolerace Costraits Process capability ad the amout of machiig allowace for each operatio are importat factors to be kept i mid durig machiig tolerace allocatio. The actual amout of material removed may vary because of process wise maufacturig errors. Hece, cumulative sum of maufacturig toleraces of all the processes is to be take ito accout while fixig the rage for metal removal. I practice, typical levels of material removal are set o the basis of each process. The costraits o maufacturig tolerace formulated are show i equatio 3.10. The term tij represets the maufacturig tolerace of j th operatio for producig i th dimesio, while Tpij deotes the deformatio allowace of j th operatio.

41 3.3.3 Process Tolerace Costrait Every process or operatio may have certai accuracy ad must be performed withi its process capability. The process tolerace costraits are formulated i equatio 3.11. Simultaeous tolerace sythesis model cosiders two costs workig had i had; Maufacturig Cost ad Quality Loss. While maufacturig cost is expressed as a fuctio of process toleraces, Quality loss is expressed i terms of desig toleraces. Quality loss eed ot be cosidered for the itermediate process toleraces as they are ot the fial toleraces. Sice quality loss is associated with desig toleraces, the toleraces of the last processes will be sufficiet. By computig Quality loss i this maer, we ca add the maufacturig cost to it. The desig tolerace costraits are formulated i equatio 3.12. 3.5 SUMMARY I the preset chapter, a aalytical model for simultaeous allocatio of toleraces for mechaical assemblies after applyig various methods, such as WCS, RSS, SM ad EMS have bee discussed i detail. Moreover, the ifluece of tolerace of positio cotrol has bee discussed. Fially, a itroductio to the evolutioary algorithms has also bee explaied. The applicability of above models to various mechaical assemblies, such as pisto cylider, wheel- mout ad rotor-key assemblies, are cosidered as

42 a optimizatio problem i the followig chapter. It is to be oted that the above optimizatio problems have bee solved usig three evolutioary algorithms, such as GA, DE ad PSO.