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

Table 1

Comparative results of two constraint-handling methods for linear BLPPs over 50 independent runs.

Problem	The improved method			Deb’s method
	SR (%)	MNFE	SD	SR (%)	MNFE	SD
A.1	100	470	0.00	100	650	0.00
A.2	100	638	0.00	100	758	0.00
A.3	100	755	0.00	100	894	0.00
A.4	100	3,684	0.00	100	3,457	0.00
A.5	100	266	0.00	100	266	0.00
A.6	100	169	0.00	100	146	0.00
A.7	98	2,652	0.09	86	2,981	0.73
A.8	100	5,070	0.00	100	5,047	0.00
A.9	98	17,614	1.93	96	19,685	4.48