A greedy randomized adaptive search procedure for transmission expansion planning

A greedy randomized adaptive search procedure (GRASP) is a heuristic method that has shown to be very powerful in solving combinatorial problems. In this paper we apply GRASP to solve the transmission network expansion problem. This procedure is an expert iterative sampling technique that has two ph...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on power systems Vol. 16; no. 2; pp. 247 - 253
Main Authors Binato, S., de Oliveira, G.C., de Araujo, J.L.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Circuits
Combinatorial analysis
Construction
Cost function
Dynamic programming
Genetic algorithms
Helium
Heuristic methods
Linear programming
Load flow
Load forecasting
Networks
Sampling
Sampling methods
Searching
Simulated annealing
Two phase
Online AccessGet full text

Cover

More Information
Summary:A greedy randomized adaptive search procedure (GRASP) is a heuristic method that has shown to be very powerful in solving combinatorial problems. In this paper we apply GRASP to solve the transmission network expansion problem. This procedure is an expert iterative sampling technique that has two phases for each iteration. The first, construction phase, finds a feasible solution for the problem. The second phase, a local search, seeks for improvements on construction phase solution by a local search. The best solution over all GRASP iterations is chosen as the result.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0885-8950
1558-0679
DOI:10.1109/59.918294