1997
DOI: 10.1109/59.574938
|View full text |Cite
|
Sign up to set email alerts
|

Parallel simulated annealing applied to long term transmission network expansion planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
60
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 127 publications
(65 citation statements)
references
References 14 publications
0
60
0
Order By: Relevance
“…(5) and (6) respectively; and for VAr sources by (7) while voltage magnitudes are restricted by (8). Capacity limits (MVA) of the line flows are presented by (9) and (10), while capacity constraints of the newly added circuits are shown by (11). The costs of VAR sources can be defined as follows:…”
Section: Teprpp Mathematical Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…(5) and (6) respectively; and for VAr sources by (7) while voltage magnitudes are restricted by (8). Capacity limits (MVA) of the line flows are presented by (9) and (10), while capacity constraints of the newly added circuits are shown by (11). The costs of VAR sources can be defined as follows:…”
Section: Teprpp Mathematical Modelmentioning
confidence: 99%
“…Various optimization techniques have been used to solve such a crucial problem. These methods are classified as classical optimization techniques [7,8] as well as meta-heuristics such as Simulated Annealing [9], Genetic Algorithms [10], Tabu Search [11] and Greedy Randomized Adaptive Search Procedure (GRASP) [12].…”
Section: Introductionmentioning
confidence: 99%
“…In the recent period, Lattore et al [13] [32][33][34], disjunctive mixed integer programming [35], branch and bound algorithm [36], implicit enumeration [37,38], Benders decomposition [12, 39,40], maximum flow [12], hierarchical decomposition [41], sensitivity analysis [42,43], genetic algorithm (GA) [44][45][46][47][48][49], object-oriented programming [50], game-theory [51][52][53][54], simulated annealing [55,56], expert systems [57,58], fuzzy set [49,59,60], greedy randomised adaptive search [61], non-convex optimisation [62], tabu search [63], ant-colony [64], data-mining [65], particle swarm optimisation (PSO) [66][67][68][69], harmony search [70,71], artificial neural network (ANN) [72], game theory [73], and robust optimisation techniques [74][75]…”
Section: Grid Developmentmentioning
confidence: 99%
“…Transmission network expansion planning (TNEP) is one of the important decisionmaking activities in electric utilities. It determines the characteristic and future electric power network [12] [13]. The planner has to estimate the most economic network which feeds the loads with the required degree of quality and to minimize construction and operational cost, while meeting technical and reliability constrains [3][4][5].TNEP should be satisfy the required adequacy of lines for delivering safe and reliable electric power to load centre However bacterial foraging can find multiple solutions [2] [14] in one single simulation run due to their population based search based approach.…”
Section: Introductionmentioning
confidence: 99%