A Strategy to Solve the Multistage Transmission Expansion Planning Problem

Abstract

In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear programming (MBLP) problem using a commercial solver with a low computational time. The heuristic uses the solution of several static transmission expansion planning problems to obtain the reduced CSS. Results using some test and real systems show that the use of the reduced CSS solves the MTEP problem with better solutions compared to other strategies in the literature.Index Terms-Combinatorial optimization, mixed binary linear programming problem, multistage transmission expansion planning.

Transmission network expansion planning considering repowering and reconfiguration

“…However, in order to find the solution using the disjunctive linear model it is necessary to determine the value of a sufficiently large constant ''M'' that, in some cases, might lead to numerical problems. The strategy to avoid the use of such constant is presented in [8], and consists in using the electrical parameter ''2 h'' (i.e. twice the maximum angle in a busbar for an electrical system) instead of ''M''.…”

“…The constraint given by (7) is the maximum generation of each generator. The constraint given by (8) represents the maximum values for the angles at the busbar. Constraint (9) provides the maximum number of new lines that can be added to the branch ij.…”

“…Such approaches include, among others, multistage dynamic planning [7][8][9], demand uncertainty [10][11][12], and the inclusion of security constraints (N À 1 criterion) [9,[13][14][15]. Solutions for these mathematical models have been proposed in the literature using different optimization techniques such as metaheuristics [7,[16][17][18][19][20], and mathematical programming, [4,6,15,21,22].…”

Expansion of Electrical Networks Considering Power Quality Aspects by Applying a Multi-objective Tabu Search Technique

“…Dynamic network planning deals with a longer planning horizon, which is divided into several periods, and it tries to answer the same questions but also answer the question of when to add new circuits. In other words, the dynamic model considers several horizons regarding the same issue [4] [5].…”

Application of Tabu Search for transmission expansion planning considering power quality aspects

“…A dynamic model tries to answer the same questions but, in addition, answers the question of when to add new circuits. In other words, the dynamic model considers several horizons in the same issue [1] [7].On the other hand, in the past, both aspects of operation and planning were in the hands of centralized institutions. Today, the separation of the electricity business has created new challenges in the restructuring industry that must be faced.…”