MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #16 3/1/02 Taguchi’s Orthogonal Arrays.

Slides:



Advertisements
Similar presentations
STATISTICS.
Advertisements

Presentation on Probability Distribution * Binomial * Chi-square
Probability Distributions CSLU 2850.Lo1 Spring 2008 Cameron McInally Fordham University May contain work from the Creative Commons.
Statistical Estimation and Sampling Distributions
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
East Los Angeles College
QBM117 Business Statistics Probability Distributions Binomial Distribution 1.
Lecture 2 Describing Data II ©. Summarizing and Describing Data Frequency distribution and the shape of the distribution Frequency distribution and the.
Regression Analysis Using Excel. Econometrics Econometrics is simply the statistical analysis of economic phenomena Here, we just summarize some of the.
Chapter 11 Contingency Table Analysis. Nonparametric Systems Another method of examining the relationship between independent (X) and dependant (Y) variables.
Independence and the Multiplication Rule
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #33 4/22/02 Fully Stressed Design.
1 Doing Statistics for Business Doing Statistics for Business Data, Inference, and Decision Making Marilyn K. Pelosi Theresa M. Sandifer Chapter 5 Analyzing.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #35 4/26/02 Multi-Objective Optimization.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #19 3/8/02 Taguchi’s Orthogonal Arrays.
Software Quality Control Methods. Introduction Quality control methods have received a world wide surge of interest within the past couple of decades.
MAE 552 Heuristic Optimization
The Simple Regression Model
Lecture 3 Sampling distributions. Counts, Proportions, and sample mean.
Chapter 6 The Normal Distribution and Other Continuous Distributions
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #18 3/6/02 Taguchi’s Orthogonal Arrays.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #20 3/10/02 Taguchi’s Orthogonal Arrays.
B a c kn e x t h o m e Classification of Variables Discrete Numerical Variable A variable that produces a response that comes from a counting process.
Incomplete Block Designs
Linear Programming Applications
Experimental Evaluation
Previous Lecture: Analysis of Variance
12.3 – Measures of Dispersion
1 Binomial Probability Distribution Here we study a special discrete PD (PD will stand for Probability Distribution) known as the Binomial PD.
Business Statistics: A First Course, 5e © 2009 Prentice-Hall, Inc. Chap 6-1 Chapter 6 The Normal Distribution Business Statistics: A First Course 5 th.
1 Doing Statistics for Business Doing Statistics for Business Data, Inference, and Decision Making Marilyn K. Pelosi Theresa M. Sandifer Chapter 15 The.
Introduction to Robust Design and Use of the Taguchi Method.
Copyright © Cengage Learning. All rights reserved. 11 Applications of Chi-Square.
Psy B07 Chapter 1Slide 1 ANALYSIS OF VARIANCE. Psy B07 Chapter 1Slide 2 t-test refresher  In chapter 7 we talked about analyses that could be conducted.
Chapter 6 The Normal Probability Distribution
Chapter 10: Working with Large Data Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University Name.
Investment Analysis and Portfolio management Lecture: 24 Course Code: MBF702.
5-1 Business Statistics: A Decision-Making Approach 8 th Edition Chapter 5 Discrete Probability Distributions.
Population All members of a set which have a given characteristic. Population Data Data associated with a certain population. Population Parameter A measure.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
MIT Objectives Review the format and expectations for the final exam Review material needed to succeed on the final exam Set the material from the course.
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 11 Section 1 – Slide 1 of 34 Chapter 11 Section 1 Random Variables.
7 - 1 Chapter 7: Data Analysis for Modeling PowerPoint Slides Prepared By: Alan Olinsky Bryant University Management Science: The Art of Modeling with.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Taguchi Methods Genichi Taguchi has been identified with the advent of what has come to be termed quality engineering. The goal of quality engineering.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 2.1.
MSE-415: B. Hawrylo Chapter 13 – Robust Design What is robust design/process/product?: A robust product (process) is one that performs as intended even.
Section 10.1 Confidence Intervals
Copyright ©2011 Pearson Education, Inc. publishing as Prentice Hall 5-1 Business Statistics: A Decision-Making Approach 8 th Edition Chapter 5 Discrete.
Issues concerning the interpretation of statistical significance tests.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
Copyright © Cengage Learning. All rights reserved. 12 Analysis of Variance.
Random Variable The outcome of an experiment need not be a number, for example, the outcome when a coin is tossed can be 'heads' or 'tails'. However, we.
UNIT 5.  The related activities of sorting, searching and merging are central to many computer applications.  Sorting and merging provide us with a.
AP Statistics Section 11.1 B More on Significance Tests.
12.3 Efficient Diversification with Many Assets We have considered –Investments with a single risky, and a single riskless, security –Investments where.
Review of fundamental 1 Data mining in 1D: curve fitting by LLS Approximation-generalization tradeoff First homework assignment.
President UniversityErwin SitompulPBST 3/1 Dr.-Ing. Erwin Sitompul President University Lecture 3 Probability and Statistics
Outline of Today’s Discussion 1.The Chi-Square Test of Independence 2.The Chi-Square Test of Goodness of Fit.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
The Law of Averages. What does the law of average say? We know that, from the definition of probability, in the long run the frequency of some event will.
TAUCHI PHILOSOPHY SUBMITTED BY: RAKESH KUMAR ME
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Estimating standard error using bootstrap
Chapter 2 Linear regression.
Linear Algebra Review.
Why/When is Taguchi Method Appropriate?
Why/When is Taguchi Method Appropriate?
Presentation transcript:

MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #16 3/1/02 Taguchi’s Orthogonal Arrays

Roulette wheel selection Implementation –The roulette wheel can be constructed as follows. Calculate the total fitness for the population as the sum of the fitness of each member.

Roulette wheel selection Implementation –The roulette wheel can be constructed as follows. Next, calculate selection probability p i for each member i = 1,n

Roulette wheel selection Implementation –The roulette wheel can be constructed as follows. Then, calculate cumulative probability q k for each member i = 1,n

Roulette wheel selection The resulting values of q i will all lie in the range [0, 1]. To actually perform the selection: – sort the designs by increasing q i – generate a random number r = U[0, 1] – select the first design with a q i higher than r. Repeat this step until your next population is full.

Background Taguchi laid the foundation for his Robust Design approach in the 50’s and 60’s. Since then, the approach has been validated by years of successful application. What is Robust Design?

Background Robust Design (as presented here) is an engineering methodology for improving productivity during R & D so that high quality products can be produced quickly and at a low cost. How does this approach fit into the class of Heuristic Optimization methods?

Background A focus of this approach is on generating information about how different design parameters affect performance under different usage conditions. Robust design enables an engineer to generate information necessary for decision- making with less (~half) experimental effort.

Background The 2 primary tasks performed in Robust Design are: 1. Measurement of Quality during design / development. –We want a leading indicator of quality by which we can evaluate the effect of changing a particular design parameter on the products performance.

Background 2.Efficient experimentation to find dependable information about the design parameters. –It is essential to obtain dependable information about the design parameters so that design changes during manufacturing and customer use can be avoided. The information should be obtained with minimum time and recources.

Background So you can tell from the last few slides that we intend to alter some parameters to achieve some goal. This is the very essence of optimization (at least as we know it in this class and in 550). As indicated in the title of this presentation, we will implement orthogonal matrix experiments in this approach.

Matrix Experiments A matrix experiment consists of a set of experiments where the settings of various product or process parameters are changed one by one to study their effect. Conducting matrix experiments using orthogonal arrays allows the effects of several parameters to be determined efficiently.

Orthogonal Arrays Ok, so what is an orthogonal array? An orthogonal array has the property that all columns are mutually orthogonal where orthogonality is interpreted in the combinatoric sense. That is, for any pair of columns, all combinations of factor levels occur and they all occur an equal number of times.

Factors and Levels Ok, so what is a factor level? A factor is a parameter over which we have some amount of control. In these experiments, all factors are discretized into levels. So for example, if a factor in our process were temperature, some levels may be 10º, 15º, 20º, etc.

Orthogonal Arrays Going back to Orthogonal Arrays, an example of an array that accommodates 3 factors with 2 levels each is shown to the right. L 4 (2 3 )Factor Exp #

Orthogonal Arrays We saw in the previous example that an array with 3 factors at 2 levels each required 4 experiments. In the upper left corner we say the designation of the array written as : L 4 (2 3 ) In general, the designation of an Orthogonal Array is given by: L # exps (# Levels # factors )

Orthogonal Arrays As previously mentioned, each pair of columns must contain all combination of factors and at an equal frequency, lets see if this is the case for our array.

Orthogonal Arrays As previously mentioned, each pair of columns must contain all combination of factors and at an equal frequency, lets see if this is the case for our array Pairing our first and second columns, we see that each possible combination appears once and only once. That is, we have: 1, 1 1, 2 2, 1 2, 2

Orthogonal Arrays As previously mentioned, each pair of columns must contain all combination of factors and at an equal frequency, lets see if this is the case for our array Now, pairing our second and third columns, we see that each possible combination again appears once and only once. That is, we have: 1, 1 2, 2 1, 2 2, 1

Orthogonal Arrays As previously mentioned, each pair of columns must contain all combination of factors and at an equal frequency, lets see if this is the case for our array Finally, pairing our first and third columns, we see that each possible combination again appears once and only once. That is, we have: 1, 1 1, 2 2, 2 2, 1

Example With all these things said, let’s get into an example We are interested in determining the effect of 4 process parameters on the formation of certain surface defects in a chemical vapor deposition (CVD) process. The 4 parameters (factors) are: A) TemperatureB) Pressure C) Settling TimeD) Cleaning Method

Example Each of our factors will have 3 levels as shown in the following table: Factor Levels 123 A: TempT 0 -25T0T0 T B: PressP P0P0 P C: Set Timetoto t o +8t o +16 D: CleanNoneCM 2 CM 3 Red indicates the starting level for each factor.

Example So for a problem with 4 factors at 3 levels each, we need an L (3 4 ) array. We see from our handout, that such an array does exist and that it is the L 9 array (shown in part below).

Example ABCD

How Do we fill in the matrix? Each entry in the matrix represents a factor level. Specifically, a level for the factor which heads the column. So we can fill in values from our table of factor levels ( a few slides back ).

Example ABCD 1T 0 -25P toto None 2T 0 -25P0P0 t o +8CM 2 3T 0 -25P t o +16CM 3 4T0T0 P t o +8CM 3 5T0T0 P0P0 t o +16None 6T0T0 P toto CM 2 7T 0 +25P t o +16CM 2 8T 0 +25P0P0 toto CM 3 9T 0 +25P t o +8None

Example So we can see that each row of the matrix defines an entire configuration of our product or process. Now, we want to use this matrix experiment in some way to determine the best setting for each parameter such that our surface defects are minimized. The first thing we need to do is determine how we will compute our observation value (this is akin to determination of our fitness in a GA).

Example In our example, we are concerned with defects on the surface of a silicon wafer. So in order to determine the relative performance of each of our configurations, we will do the following. –Set up the CVD equipment according to the parameters –Create a bunch of chips –Count the defects in 3 areas on each of 3 of our produced chips for a total of 9 counts per experiment.

Example We can then define a summary statistic, η i, that is computed as follows (for experiment i): η i = -10 log 10 (mean square defect count i ) The mean square defect count is the average of the squared-counts in each of the 9 areas for each experiment. We will then call eta our observation value. Does anyone recognize this formulation? It is the signal to noise (S/N) ratio.

Example So say for example that in one of our experiments, we had the following 3 chips: Counts: 2, 2, 2 Counts: 1, 1, 1 Counts: 2, 2, 1

Example We can calculate η for this experiment as follows: Mean squared defect count: ( ) / 9 = 3.11 The observation value is then: η = -10 * Log 10 ( 3.11 ) = Clearly, minimizing our surface defects becomes a job of maximizing our observation value.

Example ABCDη 1T 0 -25P toto None-20 2T 0 -25P0P0 t o +8CM T 0 -25P t o +16CM T0T0 P t o +8CM T0T0 P0P0 t o +16None-45 6T0T0 P toto CM T 0 +25P t o +16CM T 0 +25P0P0 toto CM T 0 +25P t o +8None-70

Example Clearly we are not done, simply conducting the experiments and selecting the best one would make this a somewhat trivial approach. What we have to do now is attempt to determine the effect that each factor has on the observation value based on what we observed in our matrix experiment.

Example The first step will be to find the overall mean of the observation values m. Since each of our factor levels was represented evenly in our matrix experiment, m in this case is referred to as a balanced overall mean.

Example The effect of a factor level is defined as the deviation it causes from the overall mean. For example, we may wish to evaluate what effect temperature at level 3 has on the process. To do this, we must calculate mean of the observation values in which temperature was at level 3. Note that there were 3 such experiments in our matrix experiment.

Example The 3 experiments containing temperature at level 3 were #’s 7, 8, and 9. So: m A3 = 1/3 (η 7 + η 8 + η 9 ) = -60 So the deviation from the overall mean caused by temperature at level 3 is: (m A3 – m) = -60 – (-41.67) = -18.3

Example Notice that in each of experiments 7, 8, and 9, pressure, settling time, and cleaning method all take on levels of 1, 2, and 3 (in different orders). Therefore, m A3 represents an average η when the temperature is at level 3 where the averaging is done in a balanced manner over all levels of each of the other 3 factors. The remaining factor level effects can be computed in the exact same fashion.