A Differential Evolution with Two Mutation Strategies and a Selection Based on an Improved Constraint-Handling Technique for Bilevel Programming Problems

Table 3

Comparative results of hybrid mutation operator and single mutation operator for linear BLPPs over 50 independent runs.

Problem	Hybrid mutation operator			Mutation operator (6)			Mutation operator (7)
	SR (%)	MNFE	SD	SR (%)	MNFE	SD	SR (%)	MNFE	SD
A.1	100	470	0.00	100	438	0.00	100	593	0.00
A.2	100	638	0.00	100	529	0.00	100	710	0.00
A.3	100	755	0.00	100	703	0.00	100	966	0.00
A.4	100	3,684	0.00	100	3,777	0.00	52	7,056	0.01
A.5	100	266	0.00	100	242	0.00	100	314	0.00
A.6	100	169	0.00	100	129	0.00	100	217	0.00
A.7	98	2,652	0.09	70	4,068	1.11	100	3,454	0.00
A.8	100	5,070	0.00	100	3,532	0.00	64	8,008	0.01
A.9	98	17,614	1.93	86	13,678	4.38	90	20,040	0.14