Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
   volgende >>
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
           Alle artikelen van de bijbehorende aflevering
                                       Details van artikel 1 van 5 gevonden artikelen
 
 
  A combination of heuristic and bacteria foraging-differential evolution algorithm for transmission network expansion planning with security constraints
 
 
Titel: A combination of heuristic and bacteria foraging-differential evolution algorithm for transmission network expansion planning with security constraints
Auteur: Verma, Ashu
Bijwe, P.R.
Panigrahi, B.K.
Verschenen in: International journal of hybrid intelligent systems
Paginering: Jaargang 7 (2010) nr. 2 pagina's 101-113
Jaar: 2010-05-17
Inhoud: Transmission network expansion planning (TNEP) is an important component of power system planning. Its task is to determine the optimal set of transmission lines to be constructed such that the cost of expansion plan is minimum and no network constraints are violated during the planning horizon. The problem is very complex due to large number of options to be analysed and the discrete nature of the optimization variables. Hence, more efficient and robust techniques are required to solve this complex problem. This paper presents a new hybrid approach for TNEP with security constraints, where first the solution is obtained very quickly with a new promising heuristic method, which is used as a starting point for the proposed metaheuristic approach known as bacteria foraging differential evolution algorithm (BF-DEA). The heuristic method used for generating the initial solution is based on a DC power flow based compensation approach to simulate single/double line modifications arising out of a candidate line addition and an outage of other line. This method can be used to quickly obtain a suboptimal/optimal transmission network expansion plan. One of the difficulties with metaheuristic methods is the possibility of premature convergence to a nonoptimal solution. The worst part is that in many situations we do not even know as to how close/far the optimal solution obtained is from the global optimum one. The plan obtained with the heuristic method provides an upper bound on the solution obtained with BF-DEA. The hybrid method thus ensures that BF-DEA will provide a solution which is much closer to the global optimum. Results for two sample systems demonstrate the potential of the proposed scheme.
Uitgever: IOS Press
Bronbestand: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details van artikel 1 van 5 gevonden artikelen
 
   volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland