2018
DOI: 10.24840/2183-6493_002.002_0006
|View full text |Cite
|
Sign up to set email alerts
|

Comparative Analysis of Constructive Heuristic Algorithms for Transmission Expansion Planning

Abstract: Transmission Expansion Planning (TEP) is a complex optimization problem that has the purpose of determining how the transmission capacity of a network should be enlarged, satisfying the increasing demand. This problem has combinatorial nature and different alternative plans can be designed so that many algorithms can converge towards local optima. This feature drives the development of tools that combine high robustness and low computational effort. This paper presents a comparative analysis and a detailed rev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…figure 7. The cost for this expansion is US$ 200.000.000,00 and this solution is the optimal expansion for this circuit (Gomes, 2014). Throughout the process the cost of the solution was varying according to Figure 8, in this figure one can note that near to iteration 400 the process change the current solution by a worst solution, i.e., with a higher cost.…”
Section: Resultsmentioning
confidence: 88%
See 1 more Smart Citation
“…figure 7. The cost for this expansion is US$ 200.000.000,00 and this solution is the optimal expansion for this circuit (Gomes, 2014). Throughout the process the cost of the solution was varying according to Figure 8, in this figure one can note that near to iteration 400 the process change the current solution by a worst solution, i.e., with a higher cost.…”
Section: Resultsmentioning
confidence: 88%
“…The solution has the expansion on the lines 4-6 (3) and 3-5 (1) as shown in figure 6. The cost for this expansion is US$ 110.000.000,00 and this solution is the optimal expansion for this circuit (Gomes, 2014). The new topology of the system with the additions of the lines is shown in Figure 5: Throughout the process the cost of the solution was varying according to Figure 6, in this figure it is evident that the exchange of current solutions to the worst solutions, with higher costs in this case, happen after the iteration number about 400, that is when the changes for cheaper solutions leave the system operating incorrectly, i.e., cutting load or with congestion on the lines.…”
Section: Resultsmentioning
confidence: 95%