Improved binary particle swarm optimization for the deterministic security-constrained transmission network expansion planning problem

Abstract

- This paper proposes an improved version of Binary Particle Swarm Optimization (BPSO) to solve the security-constrained transmission network expansion planning (TNEP) problem using the DC network model. Some modifications, such as superior population configurations, are made to improve the efficiency of the BPSO by adapting it to the needs of the TNEP to obtain better results. A parallel implementation of the improved BPSO reduces execution times. Transmission losses are included using a quadratic function and piecewise linear approximation approach. Considering transmission losses in the long-term planning horizon can avoid underinvestment in network capacity and result in a different network expansion plan. The proposed approach is validated with numerical simulations of the classic Garver system, and its performance is tested on the IEEE 24-bus and 118-bus systems for a ten-year planning horizon. The simulation results are compared to those obtained from classic BPSO to verify the efficiency of the improved version of the BPSO.