Optimal Placement of Wind Power Plants in Transmission Power Networks by Applying an Effectively Proposed Metaheuristic Algorithm

Table 13

Average computation time of each run obtained by methods for study cases.

Method	FBI	HBO	MSGO	CEA	MEA	JYA [47]
Case 1.1 (place one WPP at node 3)	35.21	30.65	32.82	28.18	28.45	∼72.4
Case 1.1 (place one WPP at node 30)	28.93	26.06	32.45	27.07	27.77	∼72.4
Case 1.2 (place one WPP at one unknown node)	27.93	31.92	27.32	27.64	27.76	—
Subcase 1.3.1 (place two WPPs at nodes 3 and 30)	51.04	53.36	53.56	53.38	52.57	—
Subcase 1.3.2 (place two WPPs at two unknown nodes)	55.18	54.05	56.27	54.18	55.14	—
Case 2.1 (place one WPP at node 3)	30.82	27.14	27.65	31.15	29.7	∼72.4
Case 2.1 (place one WPP at node 30)	28.02	28.7	28.36	28.20	28.04	∼72.4
Case 2.2 (place one WPP at one unknown node)	28.20	26.75	28.27	29.62	27.40	—
Subcase 2.2.1 (place two WPPs at nodes 3 and 30)	55.41	56.43	56.43	56.81	56.09	—
Subcase 2.2.2 (place one WPP at one unknown node)	54.04	54.14	59.2	55.19	56.12	—