A novel differential evolution algorithmic approach to transmission expansion planning

Source: OAI

ABSTRACT Nowadays modern electric power systems consist of large-scale and highly complex interconnected transmission systems, thus transmission expansion planning (TEP) is now a significant power system optimisation problem. The TEP problem is a large-scale, complex and nonlinear combinatorial problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. The accurate solution of the TEP problem is essential in order to plan power systems in both an economic and efficient manner. Therefore, applied optimisation methods should be sufficiently efficient when solving such problems. In recent years a number of computational techniques have been proposed to solve this efficiency issue. Such methods include algorithms inspired by observations of natural phenomena for solving complex combinatorial optimisation problems. These algorithms have been successfully applied to a wide variety of electrical power system optimisation problems. In recent years differential evolution algorithm (DEA) procedures have been attracting significant attention from the researchers as such procedures have been found to be extremely effective in solving power system optimisation problems. The aim of this research is to develop and apply a novel DEA procedure directly to a DC power flow based model in order to efficiently solve the TEP problem. In this thesis, the TEP problem has been investigated in both static and dynamic form. In addition, two cases of the static TEP problem, with and without generation resizing, have also been investigated. The proposed method has achieved solutions with good accuracy, stable convergence characteristics, simple implementation and satisfactory computation time. The analyses have been performed within the mathematical programming environment of MATLAB using both DEA and conventional genetic algorithm (CGA) procedures and a detailed comparison has also been presented. Finally, the sensitivity of DEA control parameters has also been investigated.

1 Bookmark
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a multistage transmission network expansion planning (TNEP) model based on a disjunctive formulation. Since the proposed TNEP model is a mixed-integer linear programming (MILP) problem, a renovated benders decomposition (BD) scheme entangled with a differential evolution algorithm (DEA) is applied to alleviate the computational cost of optimization problem. The solution procedure decomposes the original MILP problem into a master problem, applying a DEA to acquire potential solutions for integer programming (IP) problem, and two sub-problems, applying linear programming (LP) method to acquire potential solutions for LP problem. Over a course of successive iterations the master problem is cultivated by appending apposite cuts which are implied by sub problems. The proposed approach is applied to the north-eastern area of the Iranian power grid.


Available from