Abstract
Transmission network expansion planning (TNEP) is a very important problem to power system. The problem is very complex and computationally demanding because of discrete nature of decision variables and large number of options to be analyzed. Hence, more robust and efficient techniques are required to solve such problem. One of the recently developed metaheuristic, known as Harmony search (HS) has been tested for many engineering optimization problems and found to be an efficient tool for optimization. Hence, the motivation for this chapter is to investigate the application of HS for TNEP. The results for three sample test system are obtained to show the potential of the tested algorithm. The results obtained with HS are compared with basic binary GA to confirm the effectiveness of HS in terms of solution quality and number of fitness function evaluations required.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)
Kim, J.H., Geem, Z.W., Kim, E.S.: Parameter estimation of the nonlinear Muskingum model using harmony search. J. Am. Water Resour. Assoc. 37(5), 1131–1138 (2001)
Geem, Z.W.: Harmony search optimization to Pump-Included Water Distribution Network design. Civil Engineering and Environmental systems 26(3), 211–221 (2009)
Kang, S.L., Geem, Z.W.: A new structural optimization method based on the harmony search algorithm. Comput. Struct. 82(9-10), 781–798 (2004)
Geem, Z.W., Tseng, C., Park, Y.: Harmony search for generalized orienteering problem: best touring in China. LNCS, vol. 3412, pp. 741–750. Springer, Heidelberg (2005)
Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation 188, 1567–1579 (2007)
de Silva, I.J., Rider, M.J., Romero, R., Garcia, A.V., Murari, C.A.: Transmission network expansion planning with security constraints. IEE Proc. Gener. Transm. Distrib. 152(6), 828–836 (2005)
Fang, R., Hill, D.J.: A new strategy for transmission expansion in competitive electricity markets. IEEE Trans. Power Syst. 18(1), 374–380 (2003)
Romero, R., Rocha, C., Mantovani, J.R.S., Sánchez, I.G.: Constructive heuristic algorithm for the DC model in network transmission expansion planning. IEE Proc.-Gener. Transm. Distrib. 152(2), 277–282 (2005)
Haffner, S., Monticelli, A., Garcia, A., Mantovani, J., Romero, R.: Branch and bound algorithm for transmission system expansion planning using a transportation model. IEE Proc. Gener. Transm. Distrib. 147(3), 149–156 (2000)
Romero, R., Monticelli, A.: A hierarchical decomposition approach for transmission network expansion planning. IEEE Trans. Power Syst. 9(1), 373–380 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Verma, A., Bijwe, P.R., Panigrahi, B.K. (2010). A Metaheuristic Approach for Transmission System Expansion Planning. In: Panigrahi, B.K., Abraham, A., Das, S. (eds) Computational Intelligence in Power Engineering. Studies in Computational Intelligence, vol 302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14013-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-14013-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14012-9
Online ISBN: 978-3-642-14013-6
eBook Packages: EngineeringEngineering (R0)