Research Article

An Enhanced Genetic Algorithm to Solve the Static and Multistage Transmission Network Expansion Planning

Table 1

Investment proposals for the multistage expansion planning.

Proposal of [29]Proposal of [22]Proposal of [38]Better proposal by the EGAWorst proposal by the EGA

Total investment cost514,356,716 US$503,717,434 US$505,802,470 US$491,012,200 US$498,511,200 US$
Total load of shedding0.0000 MW0.0000 MW0.0000 MW0.4123 MW0.000 MW

Investment cost stage 1316,440,000 US$338,744,000 US$338,744,000 US$338,744,000 US$352,014,000 US$
Load of shedding stage 10.000 MW0.000 MW0.000 MW0.000 MW0.000 MW
Circuits proposal stage 1 𝑛 5 6 8 1 = 1, 𝑛 5 5 5 7 = 1 𝑛 5 7 8 1 = 2, 𝑛 5 5 5 7 = 1, 𝑛 5 7 8 1 = 2, 𝑛 5 5 5 7 = 1, 𝑛 5 7 8 1 = 2, 𝑛 5 5 5 7 = 1, 𝑛 5 7 8 1 = 2, 𝑛 5 5 5 7 = 1,
𝑛 5 6 - 5 7 = 1, 𝑛 5 5 6 2 = 1 𝑛 5 5 6 2 = 1, 𝑛 4 5 8 1 = 1, 𝑛 5 5 6 2 = 1, 𝑛 4 5 8 1 = 1, 𝑛 5 5 6 2 = 1, 𝑛 4 5 8 1 = 1, 𝑛 5 5 6 2 = 1, 𝑛 1 9 8 2 = 1,
𝑛 4 5 8 1 = 1, 𝑛 8 2 8 5 = 1 𝑛 8 2 8 5 = 1 𝑛 8 2 8 5 = 1 𝑛 8 2 8 5 = 1 𝑛 8 2 8 5 = 1

Investment cost stage 2122,011,272 US$76,362,750 US$76,362,750 US$76,362,750 US$66,688,920 US$
Load of shedding stage 20.0000 MW0.0000 MW0.0000 MW0.0000 MW0.0000 MW
Circuits proposal stage 2 𝑛 5 6 - 5 7 = 1, 𝑛 2 7 2 9 = 1, 𝑛 2 7 2 9 = 1, 𝑛 6 2 7 3 = 1, 𝑛 2 7 2 9 = 1, 𝑛 6 2 7 3 = 1 𝑛 2 7 2 9 = 1, 𝑛 6 2 7 3 = 1 𝑛 2 7 2 9 = 1, 𝑛 6 2 7 3 = 1,
𝑛 6 2 7 3 = 1, 𝑛 7 2 - 7 3 = 1, 𝑛 7 2 - 7 3 = 1, 𝑛 1 9 8 2 = 1 𝑛 7 2 - 7 3 = 1, 𝑛 1 9 8 2 = 1 𝑛 7 2 - 7 3 = 1, 𝑛 1 9 8 2 = 1 𝑛 7 2 - 7 3 = 1
𝑛 1 9 8 2 = 1

Investment cost stage 375,905,444 US$88,610,684 US$90,695,720 US$75,905,444 US$79,808,140 US$
Load of shedding stage 30.0000 MW0.0000 MW0.0000 MW0.4123 MW0.0000 MW
Circuit proposal stage 3 𝑛 4 3 8 8 = 2, 𝑛 1 5 1 8 = 1, 𝑛 5 2 8 8 = 1, 𝑛 1 5 1 8 = 1, 𝑛 5 2 8 8 = 1, 𝑛 1 5 1 8 = 1, 𝑛 4 3 8 8 = 2, 𝑛 1 5 1 8 = 1, 𝑛 4 3 8 8 = 2, 𝑛 1 5 1 8 = 1,
𝑛 3 0 6 5 = 1, 𝑛 3 0 7 2 = 1, 𝑛 5 5 8 4 = 1, 𝑛 5 5 6 2 = 1 𝑛 5 5 8 4 = 1, 𝑛 5 5 6 2 = 1, 𝑛 3 0 6 5 = 1, 𝑛 3 0 7 2 = 1, 𝑛 3 0 6 5 = 2, 𝑛 5 5 8 4 = 1,
𝑛 5 5 8 4 = 1, 𝑛 2 9 6 4 = 1, 𝑛 2 9 3 1 = 1, 𝑛 2 9 6 4 = 1 𝑛 2 9 3 1 = 1, 𝑛 2 9 6 4 = 2 𝑛 5 5 8 4 = 1, 𝑛 2 9 6 4 = 1, 𝑛 2 9 6 4 = 1, 𝑛 1 9 8 2 = 1,
𝑛 1 9 8 2 = 1, 𝑛 6 8 8 6 = 1 𝑛 6 8 8 6 = 1 𝑛 6 8 8 6 = 1 𝑛 1 9 8 2 = 1, 𝑛 6 8 8 6 = 1 𝑛 6 8 8 6 = 1