A Greedy Randomized Adaptive Search Procedure for Transmission Expansion Planning

By S. Binato, G. C. Oliveira, J. L. Araújo. 2001

264 citations recorded by the source corpus.

Subfields: Building and Construction, Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/6c576a0b71b9cc913c8be04828ea6310c2667b51

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Building and Construction

In Computational Theory and Mathematics

In Computer Networks and Communications

Citations in the corpus

Classification of publications and models on transmission expansion planning (2003, methodology): “The transmission expansion planning problem has been also solved using object-oriented models [51], game theory [52]‐[55], simulated annealing (SA) [56], [57], expert systems [58]‐[61], fuzzy set theory [62], and greedy randomized adaptive search procedure (GRASP) [ 63 ].”
A multiyear dynamic approach for transmission expansion planning and long-term marginal costs computation (2005, methodology): “References [15] and [16] detail the use of tabu search, [11] adopts simulated annealing, and [14] uses grasp.”
GRASP: Greedy Randomized Adaptive Search Procedures (2003, methodology): “GRASP has been applied to many problems in different areas, such as routing [18, 21, 36, 75, 105]; logic [40, 54, 98, 109, 113, 114]; covering and partitioning [12, 17, 48, 65]; location [1, 33, 37, 66, 69, 39, 73, 96, 139, 140]; minimum Steiner tree [32, 84, 85, 88, 128]; optimization in graphs [2,”
Transmission Expansion Planning From Past to Future (2006, methodology): “Other meta-heuristic approaches, such as expert systems [44]-[46], fuzzy set theory [47] and greedy randomized adaptive search procedure (GRASP) [48], have also been proposed to perform TEP.”
Strategies to Reduce the Number of Variables and the Combinatorial Search Space of the Multistage Transmission Expansion Planning Problem (2013, methodology): “A complete description of GRASP can be found in [8], [9], and [22].”
Transmission network expansion planning under a Tabu Search approach (2001, background): “Afterwards, a lot of different approaches have been proposed; see [ 4 ] for a partial review of the literature.”
A New Strategy for Transmission Expansion in Competitive Electricity Markets (2002, methodology): “Starting from Garver’s paper [2] in 1970, a variety of techniques such as branch-andbound algorithm [2], [3], sensitivity analysis [4]‐[6], Benders decomposition [7]‐[9], simulated annealing [10], genetic algorithms (GAs) [11], tabu search algorithms [12], and GRASP [ 13 ], [14] were used to study t”
Greedy Randomized Adaptive Search Procedures. (2003, unknown): “• routing [25, 29, 34, 45, 47, 53, 101, 108] • logic [58, 75, 133, 147, 151, 152] • covering and partitioning [10, 23, 26, 68, 85, 92] • location [50, 54, 93, 1, 96, 57, 99, 130, 174, 175] • minimum Steiner tree [46, 119, 120, 121, 163] • optimization in graphs [2, 3, 4, 28, 70, 76, 77, 97, 102, 105”
A Bilevel Approach to Transmission Expansion Planning Within a Market Environment (2009, methodology): “Other approaches include simulated annealing [16], genetic algorithms [17], specialized genetic algorithms [18], tabu search [19], and other heuristics [20].”
Security Constrained Multi-Stage Transmission Expansion Planning Considering a Continuously Variable Series Reactor (2017, methodology): “Meta-heuristic methods, such as, genetic algorithms [14], greedy randomized search [15], particle swarm optimization [16] and differential evolution [17] have also been proposed to solve the TEP problem.”