TECHNICAL PAPERS
Aug 14, 2009

Optimal Capacity Expansion in Electric Power Subtransmission Networks

Publication: Journal of Energy Engineering
Volume 135, Issue 3

Abstract

A procedure is proposed to determine where and when to increase the capacity of lines and transformers in a power subtransmission network. The expansion plan must minimize cost while supplying the demand for energy over a time horizon, keeping the quality and reliability standards of the network and minimizing the impact over the environment. The procedure is iterative and takes into account AC flows, reliability analysis, different scenarios, demand uncertainty, discrete investment costs, voltage constraints, capacity, and power factor. A significant contribution of this procedure is that, along with the expansion plan, it considers the optimization of the operation, specifically the movement of transformer taps and the location and sizing of reactive banks. This allows significantly reducing or delaying the investment, thus reducing its present value. The approach ensures convergence when computing the power flows and allows making an analysis of the effects of distributed generation and, if necessary, load curtailment. The model is tested on the power subtransmission network of the most important electric power distribution company in Chile, serving a city of 6 million people.

Get full access to this article

View all available purchase options and get full access to this article.

Acknowledgments

We gratefully acknowledge Chilectra for allowing us to use their subtransmission network for the real case analysis. We also acknowledge the support provided by FONDECYT (Grant No. UNSPECIFIED1070741) and the Instituto Milenio “Complex Engineering System.” We thank the Centro de Modelamiento Matemático at the Universidad de Chile for providing us with computing support.

References

Adibi, M., Polyak, R., Griva, I., Mili, L., and Ammari, S. (2003). “Optimal transformer tap selection using modified barrier-augmented Lagrangian method.” IEEE Trans. Power Syst., 18(1), 251–257.
Al-Hamouz, Z., and Al-Faraj, A. (2003). “Transmission-expansion planning based on a non-linear programming algorithm.” Appl. Energy, 76, 169–177.
Binato, S., De Oliveira, G., and Lizardo, J. (2001). “A greedy randomized adaptive search procedure for transmission expansion planning.” IEEE Trans. Power Syst., 16(2), 247–253.
Da Silva, E., Areiza, J., De Oliveira, G., and Binato, S. (2001). “Transmission network expansion planning under a tabu search approach.” IEEE Trans. Power Syst., 16(1), 62–68.
David, A. K., and Wen, F. (2001). “Transmission planning and investment under competitive electricity market environment.” Proc., IEEE Power Engineering Society Summer Meeting, IEEE, Piscataway, N.J., 1725–1730.
De Oliveira, E., Da Silva, I., Rezende, J., and Carneiro, S. (2005). “Transmission system expansion planning using a sigmoid function to handle integer investment variables.” IEEE Trans. Power Syst., 20(3), 1616–1621.
DIgSILENT. (2004). DIgSILENT Power Factory version 13.1, Gomaringen, Germany.
Fourer, R., Gay, D. M., and Kernighan, B. W. (2003). AMPL: A modeling language for mathematical programming, 2nd Ed., Duxbury, Pacific Grove, Calif.
Hiskens, I., and Davy, R. (2001). “Exploring the power flow solution space boundary.” IEEE Trans. Power Syst., 16(3), 389–395.
Jin, Y., Cheng, H., Yan, J., and Zhang, L. (2007). “New discrete method for particle swarm optimization and its application in transmission network expansion planning.” Electr. Power Syst. Res., 77, 227–233.
Luenberger, D. (2005). Linear and nonlinear programming, 2nd Ed., Springer, New York.
Mantovani, J., and Garcia, A. (1996). “A heuristic method for reactive power planning.” IEEE Trans. Power Syst., 11(1), 68–74.
Overbye, T., Cheng, X., and Sun, Y. (2004). “A comparison of the AC and DC power flow models for LMP calculations.” Proc., 37th Hawaii Int. Conf. on System Sciences, Vol. 37, Univ. of Hawaii, Hawaii, 725–734.
Pilgrim, J., Li, F., and Aggarwal, R. (2002). “Genetic algorithms for optimal reactive power compensation on the National Grid system.” Proc., IEEE Power Engineering Society Summer Meeting, Vol. 1, IEEE, Chicago, IL, 524–529.
Romero, R., and Monticelli, A. (1994). “A hierarchical decomposition approach for transmission network expansion planning.” IEEE Trans. Power Syst., 9(1), 373–380.
Sauma, E., and Oren, S. (2006). “Proactive planning and valuation of transmission investments in restructured electricity markets.” J. Regul. Econ., 30(3), 261–290.
Sepúlveda, M., Onetto, E., and Palma-Behnke, R. (2007). “Iterative heuristic response surface method for transmission expansion planning.” J. Energy Eng., 133(2), 69–77.
Villasana, R., Garver, L., and Salon, S. (1985). “Transmission network planning using linear programming.” IEEE Trans. Power Appar. Syst., PAS-104(2), 349–356.
Wachter, A., and Biegler, L. (2006). “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming.” Mathematical Program. Ser. A, 106(1), 25–57.
Waltz, R., and Plantenga, T. (2007). Knitro 5.1 user’s manual, Ziena Optimization Inc., Evanston, Ill.

Information & Authors

Information

Published In

Go to Journal of Energy Engineering
Journal of Energy Engineering
Volume 135Issue 3September 2009
Pages: 98 - 105

History

Received: Jun 12, 2008
Accepted: Feb 9, 2009
Published online: Aug 14, 2009
Published in print: Sep 2009

Permissions

Request permissions for this article.

Authors

Affiliations

Felipe Tapia [email protected]
Graduate Student, Dept. of Electrical Engineering, Pontificia Universidad Católica de Chile, Vicuña Mackenna 4860, Macul, 782-0436 Santiago, Chile. E-mail: [email protected]
Vladimir Marianov [email protected]
Professor, Dept. of Electrical Engineering, Pontificia Universidad Católica de Chile, Vicuña Mackenna 4860, Macul, 782-0436 Santiago, Chile (corresponding author). E-mail: [email protected]
Luis Vargas [email protected]
Associate Professor, Dept. of Electrical Engineering, Universidad de Chile, Beaucheff 850, 837-0448 Santiago, Chile. E-mail: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share