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

Table 5

Comparative results of two constraint-handling methods for first set of nonlinear BLPPs over 50 independent runs.

Problem	The improved method			Deb’s method
	SR (%)	MNFE	SD	SR (%)	MNFE	SD
B.1	100	1,761	0.00	98	2,107	0.71
B.2	100	1,966	0.00	100	1,610	0.00
B.3	100	3,923	0.00	100	7,085	0.00
B.4	76	7,363	2.23	66	8,903	2.50
B.5	100	379	0.00	100	379	0.00
B.6	100	2,793	0.00	100	2,726	0.00
B.7	100	1,761	0.00	98	2,107	0.71
B.8	100	2,269	0.00	100	2,448	0.00
B.9	100	404	0.00	100	432	0.00
B.10	100	2,748	0.00	100	2,875	0.00