A greedy randomized adaptive search procedure for transmission expansion planning

Author

Binato, Silvio ; De Oliveira, Gerson Couto ; De Araújo, Joao Lizardo

Author_Institution

CEPEL, Electr. Power Res. Center, Rio de Janeiro, Brazil

Volume

16

Issue

2

fYear

2001

fDate

5/1/2001 12:00:00 AM

Firstpage

247

Lastpage

253

Abstract

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

Keywords

integer programming; iterative methods; power transmission planning; random processes; search problems; construction phase; expert iterative sampling technique; greedy randomized adaptive search procedure; heuristic method; integer programming; local search; transmission expansion planning; transmission network expansion; Circuits; Cost function; Dynamic programming; Genetic algorithms; Helium; Linear programming; Load flow; Load forecasting; Sampling methods; Simulated annealing;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.918294

Filename

918294