Constraint Handling in Transmission Network Expansion Planning
2010
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.
Keywords:
- Constraint satisfaction dual problem
- Mathematical optimization
- Binary constraint
- Machine learning
- Artificial intelligence
- Local consistency
- Constraint (mathematics)
- Computer science
- Constraint satisfaction problem
- Constraint satisfaction
- Constraint logic programming
- Hybrid algorithm (constraint satisfaction)
- Slack variable
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
21
References
0
Citations
NaN
KQI