A Reactive Grasp for Transmission Network Expansion Planning

In this paper we describe an enhanced GRASP (Greedy Randomized Adaptive Search Procedure) applied to power transmission network expansion planning problems. GRASP is a metaheuristic that has been shown to be powerful in solving combinatorial problems. It is composed of two phases: the construction phase where a feasible solution is iteratively built, and a local search phase that seeks improvements within a given neighborhood of the solution found by the construction phase. The best solution over all GRASP iterations is chosen as the result. The enhancements analyzed in this paper are two: instead of using a random function in the construction phase, we use a linear bias function to guide the construction. We also applied a reactive procedure to self adjust GRASP parameters. Two real-world power transmission network expansion planning problems of the Brazilian power system are used to verify the performance of these improvements.

[1]  Ruben Romero,et al.  A zero-one implicit enumeration method for optimizing investments in transmission expansion planning , 1994 .

[2]  S. Binato,et al.  Large scale transmission network planning using optimization and heuristic techniques , 1995 .

[3]  Ruben Romero,et al.  Transmission system expansion planning by an extended genetic algorithm , 1998 .

[4]  L. L. Garver,et al.  Transmission Network Planning Using Linear Programming , 1985, IEEE Power Engineering Review.

[5]  Olle I. Elgerd,et al.  Electric Energy Systems Theory: An Introduction , 1972 .

[6]  Ruben Romero,et al.  Parallel simulated annealing applied to long term transmission network expansion planning , 1997 .

[7]  A. Santos,et al.  Interactive Transmission Network Planning Using a Least-Effort Criterion , 1982, IEEE Transactions on Power Apparatus and Systems.

[8]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[9]  M. F. Pereira,et al.  A Decomposition Approach To Automated Generation/Transmission Expansion Planning , 1985, IEEE Transactions on Power Apparatus and Systems.

[10]  B Stott,et al.  Linear Programming for Power-System Network Security Applications , 1979, IEEE Transactions on Power Apparatus and Systems.

[11]  B. Avi-Itzhak,et al.  Mathematical decomposition techniques for power system expansion planning: Volume 1, Decomposition methods and uses: Final report , 1988 .

[12]  L. L. Garver,et al.  Transmission Network Estimation Using Linear Programming , 1970 .

[13]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[14]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[15]  R. Romero,et al.  Tabu search algorithm for network synthesis , 2000 .

[16]  Ruben Romero,et al.  A hierarchical decomposition approach for transmission network expansion planning , 1994 .