Parallel Big Bang-Big Crunch-LSTM Approach for Developing a Marathi Speech Recognition System

Algorithm 2

PB3C algorithm [18].

	Initialization of “N” population and each population consist of “C” candidate solutions
	Compute the fitness of every candidate
	Set
	While (i < TC)
	for
	for j = 1 : C
	Compute the fitness of j^th candidate solution.
	end for
	Calculate the local best of b^th population
	end for
	Amongst the “N” local best solutions, find out the global best
	With the given probability, move the local best candidate solution towards the global best
	for
	Create new population around local best candidate solution
	end for
	i = i + 1
	End while
	Terminate