Escolar Documentos
Profissional Documentos
Cultura Documentos
BASED OPTIMISATION
Teaching and learning based optimisation
CONTENTS
1. Optimization classification 4
2. Introduction to TLBO, Clustering with TLBO 6-7
3. Multi objective Optimisation with TLBO 8
4. Applications of TLBO
a. Multi objective optimization with TLBO Parameter
optimization of modern machining processes using
teaching learning-based optimization algorithm
i. Ultrasonic machining 10
ii. Wire electrical discharge machining 11
b. Multi-objective optimization of heat exchangers using
a modified teaching-learning- based optimization
algorithm 12
c. Multi-objective optimization of two stage thermoelectric
cooler using a modified teachinglearning-based
optimization algorithm 13
d. Design of planar steel frames using TeachingLearning
Based Optimization 14
e. A design of IIR based digital based aids using teaching
learning based optimization 15-19
f. Size and geometry optimization of trusses using teaching
and learning based optimization 20-24
5. Conclusion 25
References 26
2|Page
Teaching and learning based optimisation
LIST OF TABLES
LIST OF DIAGRAMS-
3|Page
Teaching and learning based optimisation
ABSTRACT
4|Page
Teaching and learning based optimisation
1. OPTIMISATION CLASSIFICATION
1. Types of optimisation
5|Page
Teaching and learning based optimisation
o Mathematical Algorithms
Simplex (LP), BFGS (NLP), B&B (DP)
o Meta-Heuristic Algorithms
GA, SA, TS, ACO, PSO, TLBO..
6|Page
Teaching and learning based optimisation
2. INTRODUCTION TO TLBO
7|Page
Teaching and learning based optimisation
phase means learning from the teacher and the Learner phase means learning
through the interaction between learners.
Initialization
Satapathy and his collaborators in their works and demonstrated that TLBO
can be successfully applied to deal with the clustering. They investigated how to
use TLBO help k-means clustering and fuzzy c-means clustering to find the better
cluster-centers. The TLBO approach was compared against classical K-means
clustering and PSO clustering. From the simulation results it is observed that
TLBO may have a slow convergence but it has stable convergence trend much
earlier compared to other two algorithms and better clustering results. TLBO
algorithm was used to overcome cluster centers initialization problem in fuzzy c-
means clustering, which is very important in data clustering since the incorrect
initialization of cluster centers will lead to a faulty clustering process. The
experimental results reflected that TLBO algorithm can work globally and locally
in the search space to find the appropriate cluster-centers.
8|Page
Teaching and learning based optimisation
9|Page
Teaching and learning based optimisation
4. APPLICATIONS OF TLBO
10 | P a g e
Teaching and learning based optimisation
a. Ultrasonic machining
Ultrasonic machining process (USM) is one of the widely used modern machining
processes in various industries. In USM process the material is removed due to the
action of abrasive grains. The abrasive particles are forced on the work surface by
a tool oscillating normal to the work surface at a high frequency. The tool is
shaped as the approximate mirror image of the configuration of cavity desired on
the workpiece. The various input parameters involved in USM process are
amplitude of tool oscillation, type of abrasive, grain size of the abrasives, feed
force, volume concentration of abrasive in water slurry, etc., which affect various
performance measures of the process such as material removal rate and surface
roughness.
11 | P a g e
Teaching and learning based optimisation
It is observed that comparatively less work was carried out for the
parameter optimization of these modern machining processes. Few traditional
optimization techniques such as goal programming, feasible direction method, etc.,
had been reported to solve the problems of optimization of some of these
processes, but subsequently it was proved that the results obtained by these
traditional techniques are not the optimum and also these techniques are very
complex in nature and cannot handle multi-objective problems effectively. Hence,
recently developed new optimization technique named as teachinglearning-based
optimization (TLBO) proposed by Rao et al., 2011 and Rao et al., 2012 and Rao
and Patel (2012) is used here which does not require any algorithm-specific
parameter setting.
To check for any improvement in the results, this algorithm is considered here for
the parameters optimization of USM, AJM and WEDM processes.
12 | P a g e
Teaching and learning based optimisation
Figures -
13 | P a g e
Teaching and learning based optimisation
Fig. 3.. Two stage TEC. (a) Electrically separated and (b) electrically
connected in series.
14 | P a g e
Teaching and learning based optimisation
Design examples-
15 | P a g e
Teaching and learning based optimisation
This report describes a design of digital hearing aids. This report shows that
design of Infinite Impulse Response (IIR) digital filter with Teaching-learning-
based-optimization (TLBO) gives good result in digital hearing aids. TLBO
algorithm is used to optimize the filter coefficient of IIR filter. The error between
desired magnitude response and actual magnitude response will be minimized by
this algorithm. Three audiograms have been used to verify that high accuracy can
be achieved with direct IIR filter. The results of our study indicate that proposed
design is much simpler and able to maximize hearing.
Problem Formulation
16 | P a g e
Teaching and learning based optimisation
H z = Yz Xz
M N
k=0 k=1
where H1(z) is the transfer function of a feed forward, all-zero, filter given by-
M
H1(z) = akz-k
k=0
and H2(z) is the transfer function of a feedback, all poles, recursive filter given
by:
17 | P a g e
Teaching and learning based optimisation
N
H2(z) = 1 (1- bkz-k)
k=1
Throughout this paper sixth order Yule walk recursive IIR filter is used as
prototype which is an all pole system and its transfer function is expressed as:
6
Hy(z) = 1 (1- bkz-k )
k=1
Proposed Methodology
Step 1- Identify the extent and type of hearing loss levels on the basis of
audiogram.
Step 2- Define the limits to which amplification is to be carried out for the hearing
aid. This will depend upon the extent of hearing loss.
Step 3- Calculate the difference between actual value of amplitude and desired
value of amplitude.
Table 1: Objective function on the basis of amplitude difference
18 | P a g e
Teaching and learning based optimisation
Step 4- Run TLBO by taking two design variables(a, b) which is based on size of
population. Minimum and maximum value of the prototype filter coefficient
matrix.
Step 5- Stop optimization if stopping criteria met as optimal solution to the
problem is found i.e .optimized coefficients are found which gives the closest
matching response to normal hearing audiogram.
Step 6- On the basis of optimized solution obtained in step 5, error value is
calculated. As already stated error is the difference between actual amplification
attained through use of hearing aid and the desired amplification
Step 7- Plot the frequency matching result.
Step 8- Plot magnitude error.
Simulation results
In this section simulation of audiogram are investigated. Audiograms are
downloaded from the independent Hearing Aid Information, a public service by
Hearing Alliance of America . In this Yule walk filter is used as prototype.
The thresholds for the different types of hearing loss are as follows:
Normal hearing: 0-20dB
Mild hearing loss: 20-39dB
Moderate hearing loss: 40-59dB
Severe hearing loss: 60-89dB
Profound hearing loss: 90+ dB
Fig.7.shows Audiogram-1which has mild hearing loss at high frequency. The
maximum error is 0.5804 dB whereas that in [9] is 0.
Fig.7: Audiogram-1
19 | P a g e
Teaching and learning based optimisation
20 | P a g e
Teaching and learning based optimisation
Usually, there are two types of variables in the mathematical model for the
size and geometry optimization of the truss structures i.e. the cross-sectional area
variables and the node coordinate variables, which determine the geometry of the
structures. Compared with the truss size optimization problems which have been
extensively studied, the size and geometry optimization introduces node coordinate
variables. This not only makes the design space is of higher dimension, but also greatly
enhances the degree of nonlinearity, moreover, the optimization may lead to a local
optima. The mathematical model of size and geometry optimization problems can be
expressed as follows:
21 | P a g e
Teaching and learning based optimisation
n
Min. weight(Ai, Cj )= iAiLi
i=1
Li=Li(Cj)
gujl= [ujl-ujl>=0(j=1,2,M);(l=1,2..N)
Ai S (i=1,2,..k)
where k is the total number of truss elements; M is the number of nodes; N is the
number of nodal freedoms; Ai , Li and irepresents the cross-sectional area, the
length and the density of the ith bar respectively; Cj represents the coordination of
jth node; giand gjluare the constraint violations for member stress (include
buckling stress) and joint displacements of the structure. i is the stress of the ith
bar due to loading condition, [i] is its allowable stress. Ujlis the nodal
displacement of the lth translational degree of the jth node, [ujl] is its allowable
joint displacements. S is a set of discrete cross-section of bars.
The 18-bar planar truss is shown in Figure. The material density is 0.1 lb/in3,
and the modulus of elasticity is 10000 ksi. The stress limits of the members are subjected
to 20 ksi. Euler buckling stress constraints are , where buckling coefficient =4. Node 1,
2, 4, 6 and 8 have -20 kips in y direction. Size variables are A1 = A4 = A8 = A12 = A16, A2 =
A6 = A10 = A14 = A18, A3 = A7 = A11 = A15, A5 = A9 = A13 = A17. The cross-sectional area
variables are set [2.00, 21.75] (in2) and the interval is 0.25 in2 .Side constraints for
geometry variables are -225 y3, y5, y7, y9 245, 775 x3 1225, 525 x5 975, 275
x7 725, 25 x9 475 (in).
22 | P a g e
Teaching and learning based optimisation
The optimal weight of 18-bar truss for different population under 30 independent
runs is shown in Table .
Table2: Results of sensitivity analysis of the 18-bar truss for 30 independent runs
23 | P a g e
Teaching and learning based optimisation
24 | P a g e
Teaching and learning based optimisation
TLBO has almost the same number of structural analyses with GSO. It is obvious from
table that the result of TLBO is the best. It is obvious that the TLBO requires less
computation effort to reach convergence and its convergence rate is faster than that of
GSO.
25 | P a g e
Teaching and learning based optimisation
6. Conclusions
The performance comparisons are done with TLBO and other evolutionary
computation techniques like particle swarm optimization (PSO), Differential evolution (DE),
artificial bee colony (ABC) and several of variants of these algorithms suggested by other
researchers. From the results analysis it is evident that TLBO outperforms all other approaches.
The efficiency of the proposed approach is compared with other algorithms in terms of number
of function evaluations (FEs). We can conclude by saying that TLBO is a very powerful
approach of optimizing different types of problems which are separable, non-separable,
unimodal and multimodal in providing quality optimum results in faster convergence time
compared to very popular evolutionary techniques like PSO, DE, ABC and its variants. This may
be used to multi-objective optimization problems and also some engineering applications from
mechanical, chemical or data mining may be investigated.
It does not require any algorithm-specific parameters, Only the common control
parameters are needed. Within the examples considered, the results of TLBO obtained are as
good as or better than that of other algorithms in terms of both convergence rate and convergence
accuracy. Thus TLBO proves to be a rising star from amongst a number of metaheuristics.
26 | P a g e
Teaching and learning based optimisation
References
27 | P a g e