SECURITY-CONSTRAINED AC/DC TRANSMISSION EXPANSION PLANNING USING METAHEURISTIC ALGORITHMS

Main Article Content

BUI NGUYEN DUC HUY
DUONG THANH LONG

Abstract

Integrating security constraints is an essential requirement in transmission expansion planning (TEP) to guarantee system reliability. However, fulfilling this security criterion leads to high investment costs, which are primarily to accommodate rare contingency conditions and create significant economic waste. To mitigate this inefficiency, high-voltage direct current (HVDC) technology has been recognized as a highly economic replacement for conventional high-voltage alternating current (HVAC) systems, particularly for long-distance transmission lines. As a result, this study presents a security-constrained AC/DC TEP formulation to evaluate its economic advantages compared to the traditional HVAC transmission expansion approach. The proposed model is structured as a bi-level optimization problem: the master problem determines the optimal transmission investment proposals, while the subproblem evaluates operational security constraints. To obtain high-quality solutions, the bound limitation-evolution search modified artificial rabbits optimization (BL-ES-MARO) algorithm is applied to solve the considered problem on the well-known Garver 6-bus and IEEE 14-bus systems. Simulation results demonstrate two primary findings. First, the obtained AC/DC expansion plans yield substantial cost savings of up to 84.8 M$ and 289.84 M$ compared to conventional AC expansion plans on these systems, respectively. Second, the BL-ES-MARO algorithm shows superior performance in both optimality and robustness when compared to conventional differential evolution (DE), particle swarm optimization (PSO), and state-of-the-art glider snake optimizer (GSO).

Article Details

Section
Mechanical Technology, Energy