Multi-period optimal capacity expansion planning scheme of regional integrated energy systems considering multi-time scale uncertainty and generation low-carbon retrofit

With increasingly challenging climate crisis, carbon neutrality has become a necessary path for the whole world. However, there still lacks a comprehensive investigation on the optimal capacity expansion planning for a low-carbon transformation while considering multiple uncertainties. In this paper, a multi-period optimal capacity expansion planning scheme for regional integrated energy systems considering multi-time scale uncertainties and generation low-carbon retrofit is proposed. First, to better describe the short-time scale uncertainty caused by renewable energy and load fluctuations, a multi-dimensional tempo-spatial correlated scenario generation method is proposed to more accurately capture stochastic features with the least amounts of representative scenarios. Second, a multi-period optimal planning model considering generation low-carbon retrofit and short-/long-time scale uncertainties is developed. The proposed model combines information gap decision theory and chance constraints to stress both uncertainties simultaneously, which is further linearized to facilitate the computation. Third, an improved bilinear Benders decomposition (IBBD) method is utilized to efficiently solve the proposed large-scale optimal planning problem. Finally, numerical experiments of a real world test system of WF city show: 1) the maximum errors of PDF and CDF between generated scenarios and historical data are 0.108 and 0.016, validating the effectiveness of the proposed scenario generation method; 2) the low-carbon retrofit reduces system carbon emissions by 14.12 × 107 kg, while the total system cost is $956,411,387 with additional energy coupling units and renewables installed, indicating the reliability of the multi-period planning model; 3) the IBBD algorithm demonstrates applicability and efficiency in solving the proposed multi-period optimal expansion planning problem, reducing computation time by over 80.39 % compared to commercial solvers, such as GUROBI.