An Efficient Imperialist Competitive Algorithm for Solving the QFD Decision Problem

Table 2

Results obtained by using the following algorithm.

Problem		G-ICA		GA	()-ES	()-ES	SSA	RST2U	RST2ANU
1		100		90	100	100	100	100	100
		0.0268		0.5294	0.2467	5.7895	0.0998	0.0325	0.0301
	FEs	162		8360	1667	38200	1227	372	392
2		90	100	60	100	90	100	100	100
		0.0413	0.0627	0.5872	0.4972	2.4193	0.1660	0.0767	0.0798
	FEs	1016.2	1514.6	19915	2857	16250	2113	1132	1048
3		42	100	1	20	7	2	66	64
		6.0803	18.0082	9.9711	36.9382	55.5372	29.325	26.8132	26.8426
	FEs	303480	1000263	330090	339173	376063	319153	303552	303273
4		65		1	5	1	23	26	29
		5.4450		70.4521	230.7150	266.5970	30.3212	19.0057	20.0926
	FEs	260078		1992365	1852329	2281264	372594	253928	267426
5		59		—	51	—	39	35	39
		55.4304		—	156.1188	—	453.7673	615.7494	629.7191
	FEs	5000049		—	1061945	—	5135906	5247020	5132926
6		37		—	9	1	1	89	89
		5.3581		—	144.6187	187.3324	38.2674	12.4025	12.5823
	FEs	450103		—	807780	1007993	500240	100100	91705
7		24		—	—	—	—	3	3
		36.7097		—	—	—	—	301.2364	297.8793
	FEs	5000259		—	—	—	—	5045722	5012452

Index: —the percentage of success, t—average time in seconds used by the algorithm in achieving the optimal solution in the case of the successful runs, and FEs—the average number of function evaluations in the case of successful runs.