Constraint Handling in Transmission Network Expansion Planning
Transmission network expansion planning (TNEP) is a very important and complex problem in power system. Recently, the use of metaheuristic techniques to solve TNEP is gaining more importance due to their effectiveness in handling the inequality constraints and discrete values over the conventional gradient based methods. Evolutionary algorithms (EAs) generally perform unconstrained search and require some additional mechanism to handle constraints. In EA literature, various constraint handling techniques have been proposed. However, to solve TNEP the penalty function approach is commonly used while the other constraint handling methods are untested. In this paper, we evaluate the performance of different constraint handling methods like Superiority of Feasible Solutions (SF), Self adaptive Penalty (SP),\(\mathcal E\)-Constraint (EC), Stochastic Ranking (SR) and the ensemble of constraint handling techniques (ECHT) on TNEP. The potential of different constraint handling methods and their ensemble is evaluated using an IEEE 24 bus system with and without security constraints.
KeywordsTransmission network expansion planning differential Evolution security constraints optimization constraint handling
Unable to display preview. Download preview PDF.
- 1.Garver, L.L.: Transmission network estimation using linear programming. IEEE Transactions on PAS 89(7), 1688–1697 (2007)Google Scholar
- 15.Mallipeddi, R., Suganthan, P.N.: Ensemble of Constraint Handling Techniques. IEEE Transactions on Evolutionary Computation (2010)Google Scholar
- 17.de Silva, I., Rider, M.J., Romero, R., Garcia, A.V., Murari, C.A.: Transmission network expansion planning with security constraints. In: IEE Proc. Gener. Transm. Distrib., vol. 152(6), pp. 828–836 (2005)Google Scholar