Professional Documents
Culture Documents
IN
ELECTRICAL MACHINE DESIGN
COMPUTER AIDED DESIGNING
• Analysis method means use of computer only for the purpose of analysis
leaving all exercises of judgement to the designer.
• In this method, Choice of dimension, material and type of construction are
made by the designer punched in computer as input.
• The performance is calculated by the computer and is return to the designer for
his examine.
• Designer examine the performance and make changes if required.
• This process is repeated till satisfied result obtained.
FLOWCHART FOR ANALYSIS METHOD
SYNTHESIS MODEL
• This method incorporate both the analysis as well as the synthesis method.
• Since the synthesis method involves grater cost, the major part of the design is
based on analysis method.
• Only limited portion of designing is done using synthesis method.
Various objective parameters for optimisation in an
electrical machine:
•Higher Efficiency
•Lower Weight for given KVA output (Kg/KVA)
•Lower Temperature-Rise
•Lower Cost
•Any Other Parameter like higher PF for induction motor, higher reactance etc.
FLOWCHART FOR COMPUTER AIDED DESIGN OF TRANSFORMER
FLOWCHART FOR COMPUTER AIDED DESIGN OF 3-PH INDUCTION MOTOR
WHAT IS OPTIMIZATION?
• Optimization - an act, process, or methodology of making something (such as a design, system, or
decision) as fully perfect, functional, or effective as possible;
• In the simplest case, an optimization problem consists of maximizing or minimizing a real function by
systematically choosing input values from within an allowed set and computing the value of the
function.
• More generally, optimization includes finding "best available" values of some objective function
given a defined domain (or input), including a variety of different types of objective functions and
different types of domains.
• It is primarily being used in those design activities in which the goal is not only to achieve just a
feasible design, but also a design which is fully functional and effective to take maximum
advantage of the resources available.
• An optimization algorithm is a procedure which is executed iteratively by comparing various
solutions till the optimum or a satisfactory solution is found.
• With the advent of computers, optimization has become a part of computer- aided design activities.
• In most engineering design activities, the design objective could be simply to minimize the cost
of production or to maximize the efficiency of production.
WHERE IS OPTIMIZATION USED:
•The constraints represent some functional relationships among the design variables
and other design parameters satisfying certain physical phenomenon and certain
resource limitations.
•There are usually two types of constraints that emerge from most considerations:
•The objective function can be of two types. Either the objective function is to be
maximized or it has to be minimized
VARIABLE BOUNDS
•The final task of the formulation is to set the minimum and the maximum bounds on
design variable.
OPTIMAL PROBLEM FORMULATION
The objective in a design problem and the associated design parameters vary from product
to product.
Different techniques need to be used in different problems.
The purpose of the formulation procedure is to create a mathematical model of the
optimal problem, which then can be solved using an optimization algorithm.
FLOWCHART FOR OPTIMIZTION PROCESS
MACHINE OPTIMIZATION FACTORS:
These algorithms demonstrate how the search for the optimum point progress in
multiple dimensions.
Different methods in multi- variable optimization algorithms are:-
1. Unidirectional Search Method
2. Direct Search Method
3. Gradient-based Methods
MULTIVARIABLE OPTIMIZATION ALGORITHMS
•In a multivariable function, the gradient of a function is not a scalar quantity;
instead it is a vector quantity.
•The optimality criteria can be derived by using the definition of a local optimal
point and by using Taylor’s series expansion of a multivariable function.
•Without going into the details of the analysis, the optimality criteria for a
multivariable function.
•Assume that the objective function is a function of N variables represented by x1,
x2 ,….., xN .
•The gradient vector at any point x(t) is represented by V f(x(t)) which is an
N-dimensional vector given as follows:
Subject to
gj (x) > 0, j=1,2,3,……,Ji
hk (x)=0 k=1,2,3,……, Ki
xi(L) < xi < xi(U) , i=1,2,3,……,N.
Step One: Generate the initial population of individuals randomly. (First generation)
Step Two: Evaluate the fitness of each individual in that population (time limit, sufficient fitness
achieved, etc.)