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
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Several extensions to evolutionary algorithms (EAs) and particle swarm optimization (PSO) have been suggested during the last decades offering improved performance on selected benchmark problems. Recently, another search heuristic termed differential evolution (DE) has shown superior performance in several real-world applications. In this paper, we evaluate the performance of DE, PSO, and EAs regarding their general applicability as numerical optimization techniques. The comparison is performed on a suite of 34 widely used benchmark problems. The results from our study show that DE generally outperforms the other algorithms. However, on two noisy functions, both DE and PSO were outperformed by the EA.
    Evolutionary Computation, 2004. CEC2004. Congress on; 07/2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: One aspect of long-range planning of electric power systems involves the exploration of various designs for the bulk power transmission network. The use of linear programming for network analysis to determine where capacity shortages exist and, most importantly, where to add new circuits to relieve the shortages is presented. The new method of network estimation produces a feasible transmission network with near-minimum circuit miles using as input any existing network plus a load and generation schedule. An example is used to present the two steps of the method: 1) linear flow estimation and 2) new circuit selection. The method has become a fundamental part of computer programs for transmission network synthesis.
    IEEE Transactions on Power Apparatus and Systems 10/1970;
  • [Show abstract] [Hide abstract]
    ABSTRACT: The paper presents an evolutionary programming approach to transmission network planning in electric power systems. This is a mixed-integer nonlinear programming problem, with a combinatorial nature that leads to an extremely large number of alternative solutions for medium and large size electric systems. The transmission planning problem is briefly described and subsequently formulated in mathematical terms. The proposed evolutionary programming algorithm is applied to a reference electric system for which the solution is known and its performance is compared with simulated annealing, genetic algorithms and tabu search. The application of the proposed algorithm to a large electric network that is representative of the Mexican electric system is reported
    Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on; 02/1999


Available from