2003
DOI: 10.1049/ip-gtd:20030725
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
32
0
14

Year Published

2010
2010
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 70 publications
(46 citation statements)
references
References 9 publications
0
32
0
14
Order By: Relevance
“…Numerically, the circuit performance according to the topology is used, such as the objective of such indices. Some of the major shortcomings have been addressed in [19]. Most of the constructive algorithms perform a greedy search, which rarely results in good solutions for realistic systems.…”
Section: Solution Methodologymentioning
confidence: 99%
“…Numerically, the circuit performance according to the topology is used, such as the objective of such indices. Some of the major shortcomings have been addressed in [19]. Most of the constructive algorithms perform a greedy search, which rarely results in good solutions for realistic systems.…”
Section: Solution Methodologymentioning
confidence: 99%
“…This is a kind of starting point, but a more precise analysis should take into account trends of electric energy production [8]. With respect to this, a dynamic model should be implemented for the evaluation of the savings on primary production, on CO 2 emissions and on local impacts [9].…”
Section: Companymentioning
confidence: 99%
“…The derived multistage model will be inherited all properties and efficiencies from the original single stage model. Examples of the previous works can be found in [14] and [15]. For the formulation proposed in [14], the DC model is employed based on the integer decision variables.…”
Section: Introductionmentioning
confidence: 99%
“…In the case of the formulation presented in [15], the transportation model is applied with a constructive heuristic algorithm. Even though the formulated problem is MILP which is very simpler than MINLP, the KVL constraints are neglected in the formulation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation