Mutation-Based Harmony Search Algorithm for Hybrid Testing of Web Service Composition

Table 7

Parameters of four algorithms in the feasibility and scalability analysis.

Algorithm	Population size	Iteration	Value of other parameters
MBHS	{20, 30, 200, 500}	{200, 1000, 2000, 4000}	Number of new harmonies: Nh = {5, 10}
			HMCR = {0.90, 0.99}
			PAR = {0.01, 0.1}
DPSO	{20, 30, 200, 500}	{200, 1000, 2000, 4000}	—
GA	{20, 30, 200, 500}	{200, 1000, 2000, 4000}	Probability of crossover: Pc = 0.8
			Probability of mutation: Pm = {0.01, 0.1}
			Selector: Elitism
PBSA	{2, 10, 15, 20}	{200, 1000, 2000, 4000}	Initial temperature: T0 = 100
			Cooling rate: Alpha = {0.9, 0.99}
			Number of neighbor for each member: nMove = {3, 10, 15, 25}