Finding Optimal Load Dispatch Solutions by Using a Proposed Cuckoo Search Algorithm

Table 15

Performance improvement summary of the proposed method.

Study cases	Reduction cost ($)		Improvement level (%)		Execution time (s)
	From	To	From	To	Slowest method	Fastest method	Proposed method
Subcase 1.3	0.486	0.526	0.0304	0.0329	-	-	0.09
Subcase 1.4	59.049	75.229	0.7053	0.8968	-	-	0.12
ase 2	0.17	17751.49	0.0001	8.2282	-	-	7.6
Subcase 3.1	0.2	118.1256	0.0024	1.4143	-	-	0.1
Subcase 3.2	0	84.38	0	0.47	294.96	0.85	0.95
Subcase 3.3	0	91.13	0	0.38	34.25	0.65	0.95
Subcase 3.4	0	1211.81	0	0.99	1167.35	1.55	1.46
Subcase 3.5	4.1	34.12	0.001688	0.01405	1279.7	-	3.3
Subcase 4.1	0	0.4329	0	0.0003	563.81	2.028	0.92
Subcase 4.2	0.1457	3.0227	0	0.002	940.93	3.036	1.59
ase 5	0.7378	407.002	0.0023	1.2291	81.8	4.8	4.6
Subcase 6.1	1.5545	1.8183	0.031	0.04	309.41	15.24	8.48
Subcase 6.2	0	139.65	0	1.38	75.42	5.71	11.19
Subcase 6.3	0	118.17	0	0.59	96.41	59.82	17.14