TLBO and JAYA: Insights into Novel …
241
X
j,k,i is accepted if it gives superior functional value than X j,k,i these accepted
functional values become input values to the learner’s phase.
2. Learners phase. Learners knowledge improved by interacting among themselves.
Two learners (K = 1…n) are randomly selected, e.g. 1 and 2, the condition is
X
total,1,i = X
total,2,i
For minimization:
X
j,1,i = X
j,1,i + r i (X
j,1,i − X
j,2,i ) if X
total,1,i total,2,i
X
j,1,i = X
j,1,i + r i (X
j,2,i − X
j,1,i ) if X
total,2,i total,1,i
For maximization:
X
j,1,i = X
j,1,i + r i (X
j,1,i − X
j,2,i ) if X
total,2,i total,1,i
X
j,1,i = X
j,1,i + r i (X
j,2,i − X
j,1,i ) if X
total,1,i total,2,i
X
j,k,i is accepted if it gives superior function value than X
j,k,i . If this satisfies
termination criteria report the solution and stop the process, if not go to the next
iteration. The flow chart of TLBO is presented in Fig. 1.
Fig. 1 Flow chart of TLBO algorithm (Source Comput. Aided. Des. p. 305)