2010
DOI: 10.1049/iet-gtd.2009.0611
|View full text |Cite
|
Sign up to set email alerts
|

Harmony search algorithm for transmission network expansion planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

4
75
0
3

Year Published

2011
2011
2018
2018

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 114 publications
(82 citation statements)
references
References 22 publications
4
75
0
3
Order By: Relevance
“…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%
“…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%
“…The idea of HS is based on mimicking the improvisation process of music players that improvise the pitches of their instruments to obtain better harmony [18]. The harmony in music is analogous to the optimization solution, and the musician's improvisations are similar to local and global search schemes in optimization methods [19].…”
Section: The Proposed Stlf Strategymentioning
confidence: 99%
“…Thus, HS has a good potential to be used as an optimization technique. Since its inception, HS has successfully been applied to several practical optimization problems [18][19][20]. However, to the best of our knowledge, no research work has so far formulated application of HS (or any modified version of it) for NN training.…”
Section: The Proposed Stlf Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…such as those presented in [3,25]. The key aspects of implementing a meta- In the beginning, the algorithm performs the pre-process stage described as number of added line limits (14e) and network interconnectivity (14f).…”
mentioning
confidence: 99%