Hybrid Binary PSO for Transmission Expansion Planning Considering N-1 Security Criterion

Abstract

This paper presents an hybrid method based on the metaheuristic Particle Swarm Optimization (PSO) and quadratic programming (QP) for solving the multi-stage transmission expansion planning (TEP) problem. PSO solves the investment problem and QP solves the operational cost problem. Transmission losses and the N-1 security criterion are included in this model to give a more comprehensive approach. Undertaking a complete N-1 security analysis for any network topology is time consuming. To improve the convergence speed and to reduce computational effort, Line Outage Distribution Factors (LODF) are used to calculate the line's post-contingency power flows. The proposed approach is initially validated through numerical simulations of the classic Garver's system, and its performance is later tested and compared with other in the literature on the IEEE 24-bus system.