Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Binato, G.C. Oliveira, and J.L. Araújo. A Greedy Adaptive Search Procedure for Transmission Expansion Planning. Technical report, CEPEL, 1998. To appear in IEEE Transactions on Power Systems.
S. Binato and S.P. Roméro. Power Transmission Network Expansion Planning by a Hybrid Genetic Algorithm. In: Proceedings of the IX Latin-IberoAmerican Congress on Operations Research (IX CLAIO), Buenos Aires, 1998.
S. Binato and S.P. Roméro. Genetic Algorithms with Genetic Engineering. In: Extended abstracts of the Third Metaheuristic International Conference, pages 63–68, Angra dos Reis, 1999.
J.L. Bresina. Heuristic-Biased Stochastic Sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 271–278, 1996.
C. DeChamps, J. Vankelecom, and E. Jamoulle. TRANEX — An Interactive Computer Program for Transmission Expansion. IEEE Summer Power Metting, paper A79 476–3, 1979.
O.I. Elgerd.Electric Energy Systems Theory: An Introduction. McGraw-Hill, 1971.
T.A. Feo and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6:109–133, 1995.
R.A. Galego, A. Monticelli, and R. Romero. Transmission System Expansion Planning by Extended Genetic Algorithm. Generation, Transmission and Distribution, IEE Proceedings, 145:329–335, 1998.
R.A. Galego, R. Romero, and A. Monticelli. Tabu Search Algorithm for Network Synthesis. IEEE Transactions on Power Systems, 15:490–495, 2000.
R.A. Gallego, A.B. Alves, A. Monticelli, and R. Romero. Parallel Simulated Annealing Applied to Long Term Transmission Expansion Planning. IEEE Transactions on Power Systems, 12:181–187, 1997.
L.L. Garver. Transmission Network Estimation using Linear Programming. IEEE Transactions on Power Apparatus and Systems, PAS-89.1688–1687, 1970.
S. Granville, M.V.F. Pereira, G.B. Dantzig, B. Avi-Itzhak, M. Avriel, A. Monticelli, and L.M. V.G. Pinto. Mathematical Decomposition Techniques for Power System Expansion Planning — Analysis of the Linearized Power Flow Model using the Benders Decomposition Technique. Technical Report RP 2473–6, EPRI, 1988.
S. Granville, M.V.F. Pereira, G.B. Dantzig, B. Avi-Itzhak, M. Avriel, A. Monticelli, and L.M. V.G. Pinto. Mathematical Decomposition Techniques for Power System Expansion Planning — Decomposition Methods and Uses. Technical Report RP 2473–6, EPRI, 1988.
A. Monticelli, A. Santos Jr., M.V.F. Pereira, S.H.F. Cunha, J.G. Praça, and B. Park. Interactive Transmission Network Planning using a Least-Effort Criterion. IEEE Transactions on Power Apparatus and Systems, PAS-101:3919–3925, 1982.
G.C. Oliveira, A.P. Costa, and S. Binato. Large Scale Transmission Network Planning using optimization and Heuristic Techniques. IEEE Transactions on Power Systems, 10:1828–1834, 1995.
B.J. Parker, A. Tanabe, and M.T. Schilling. Accuracy of Linearized Power-Flow Model Simulation of the Brazilian Network. Technical Report 018/80, Eletrobrás, 1980.
M.V.F. Pereira, L.M. V.G. Pinto, S.H.F. Cunha, and G.C. Oliveira. A Decomposition Approach to Automated Generation-Transmission Expansion Planning. IEEE Transactions on Power Apparatus and Systems, PAS-104:3074–3083, 1985.
M. Prais and C.C. Ribeiro. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment. INFORMS Journal on Computing, 12:164–176, 2000.
R. Romero, R.A. Gallego, and A. Monticelli. Transmission System Expansion Planning by Simmulated Annealing. In: Proceedings of the 1995 Conference on Power Industry Computer Applications, pages 278–283, Salt Lake City, 1995.
R. Romero and A. Monticelli. A Hierarchical Decomposition Approach for Transmission Expansion Planning. IEEE Transactions on Power Systems, 9:373–380, 1994.
R. Romero and A. Monticelli. A Zero-One Implicit Enumeration Method for Optimizing Investments in Transmission Expansion Planning. IEEE Transactions on Power Systems, 9:1385–1391, 1994.
B. Stott and J.L. Marinho. Linear Programming for Power System Network Security Applications. IEEE Transactions on Power Apparatus and Systems, PAS-99:837–848, 1979.
P. Tsamasphyrou, A. Renaud, and P. Carpentier. Transmission Network Planning: An efficient Benders Decomposition Scheme. In Proceedings of the 13th Power System Computing Conference, pages 487–494, 1999.
R. Villasana, L.L. Garver, and S.J. Salon. Transmission Network Planning using Linear Programming. IEEE Transactions on Power Apparatus and Systems, PAS-104:349–356, 1985.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Binato, S., Oliveira, G.C. (2002). A Reactive Grasp for Transmission Network Expansion Planning. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive