Optimal placement of PMUS in power systems using binary integer programming and genetic algorithm

MedPower 2014 ◽  
2014 ◽  
Author(s):  
N.P. Theodorakatos ◽  
N.M. Manousakis ◽  
G.N. Korres
Keyword(s):  
Genetic Algorithm ◽  
Integer Programming ◽  
Power Systems ◽  
Optimal Placement ◽  
Binary Integer Programming

The DNA Genetic Algorithm Applied for Solving Optimal Placement of Sensors

2012 ◽  
Vol 160 ◽  
pp. 103-108
Author(s):  
Xin Liu ◽  
Zhong Ren Feng ◽  
Xiong Jian Wang ◽  
Bao Fu Wang
Keyword(s):  
Genetic Algorithm ◽  
Integer Programming ◽  
Expected Value ◽  
Optimal Placement ◽  
Stochastic Integer Programming ◽  
Objective Functions ◽  
Stochastic Variable ◽  
Expected Value Model ◽  
Complex Knowledge ◽  
Value Model

In order to solve optimal placement of bridge sensors based on the modal information, a multi-objective integer programming expected value model is established and the number of modal is considered as a stochastic variable in this paper, and here Fisher and MAC matrix are combined as the objective functions . Since DNA Genetic algorithm has the merits of plentiful coding, and decoding, conveying complex knowledge flexibly, these merits and the technique of stochastic simulation are also combined, which for estimating stochastic integer programming expected value models problem. And finally the feasibility of the algorithm is showed by XuGe Bridge as an example.

scholarly journals Towards Merging Binary Integer Programming Techniques with Genetic Algorithms

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Reza Zamani
Keyword(s):  
Genetic Algorithm ◽  
Integer Programming ◽  
Optimization Problems ◽  
Mathematical Formulation ◽  
Integer Program ◽  
Binary Integer Programming ◽  
Programming Technique ◽  
Combinatorial Optimization Problems ◽  
Programming Techniques ◽  
Feasible Solutions

This paper presents a framework based on merging a binary integer programming technique with a genetic algorithm. The framework uses both lower and upper bounds to make the employed mathematical formulation of a problem as tight as possible. For problems whose optimal solutions cannot be obtained, precision is traded with speed through substituting the integrality constrains in a binary integer program with a penalty. In this way, instead of constraining a variable u with binary restriction, u is considered as real number between 0 and 1, with the penalty of Mu(1-u), in which M is a large number. Values not near to the boundary extremes of 0 and 1 make the component of Mu(1-u) large and are expected to be avoided implicitly. The nonbinary values are then converted to priorities, and a genetic algorithm can use these priorities to fill its initial pool for producing feasible solutions. The presented framework can be applied to many combinatorial optimization problems. Here, a procedure based on this framework has been applied to a scheduling problem, and the results of computational experiments have been discussed, emphasizing the knowledge generated and inefficiencies to be circumvented with this framework in future.

Optimal Placement of FACTS Devices for Voltage Stability Improvement with Economic Consideration Using Firefly Algorithm

2019 ◽  
Vol 14 (1) ◽  
pp. 5-11
Author(s):  
S. Rajasekaran ◽  
S. Muralidharan
Keyword(s):  
Power Systems ◽  
Voltage Stability ◽  
Firefly Algorithm ◽  
Transmission System ◽  
Operating Conditions ◽  
Optimal Placement ◽  
Voltage Collapse ◽  
Facts Devices ◽  
The Cost ◽  
Bus System

Background: Increasing power demand forces the power systems to operate at their maximum operating conditions. This leads the power system into voltage instability and causes voltage collapse. To avoid this problem, FACTS devices have been used in power systems to increase system stability with much reduced economical ratings. To achieve this, the FACTS devices must be placed in exact location. This paper presents Firefly Algorithm (FA) based optimization method to locate these devices of exact rating and least cost in the transmission system. Methods: Thyristor Controlled Series Capacitor (TCSC) and Static Var Compensator (SVC) are the FACTS devices used in the proposed methodology to enhance the voltage stability of power systems. Considering two objectives of enhancing the voltage stability of the transmission system and minimizing the cost of the FACTS devices, the optimal ratings and cost were identified for the devices under consideration using Firefly algorithm as an optimization tool. Also, a model study had been done with four different cases such as normal case, line outage case, generator outage case and overloading case (140%) for IEEE 14,30,57 and 118 bus systems. Results: The optimal locations to install SVC and TCSC in IEEE 14, 30, 57 and 118 bus systems were evaluated with minimal L-indices and cost using the proposed Firefly algorithm. From the results, it could be inferred that the cost of installing TCSC in IEEE bus system is slightly higher than SVC.For showing the superiority of Firefly algorithm, the results were compared with the already published research finding where this problem was solved using Genetic algorithm and Particle Swarm Optimization. It was revealed that the proposed firefly algorithm gives better optimum solution in minimizing the L-index values for IEEE 30 Bus system. Conclusion: The optimal placement, rating and cost of installation of TCSC and SVC in standard IEEE bus systems which enhanced the voltage stability were evaluated in this work. The need of the FACTS devices was also tested during the abnormal cases such as line outage case, generator outage case and overloading case (140%) with the proposed Firefly algorithm. Outputs reveal that the recognized placement of SVC and TCSC reduces the probability of voltage collapse and cost of the devices in the transmission lines. The capability of Firefly algorithm was also ensured by comparing its results with the results of other algorithms.

scholarly journals Optimal Placement and Sizing of D-STATCOM in Radial and Meshed Distribution Networks Using a Discrete-Continuous Version of the Genetic Algorithm

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1452
Author(s):  
Cristian Mateo Castiblanco-Pérez ◽  
David Esteban Toro-Rodríguez ◽  
Oscar Danilo Montoya ◽  
Diego Armando Giral-Ramírez
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Programming Model ◽  
Distribution Networks ◽  
Optimization Method ◽  
Optimal Placement ◽  
Mixed Integer ◽  
Power Balance ◽  
Continuous Version ◽  
Discrete Part

In this paper, we propose a new discrete-continuous codification of the Chu–Beasley genetic algorithm to address the optimal placement and sizing problem of the distribution static compensators (D-STATCOM) in electrical distribution grids. The discrete part of the codification determines the nodes where D-STATCOM will be installed. The continuous part of the codification regulates their sizes. The objective function considered in this study is the minimization of the annual operative costs regarding energy losses and installation investments in D-STATCOM. This objective function is subject to the classical power balance constraints and devices’ capabilities. The proposed discrete-continuous version of the genetic algorithm solves the mixed-integer non-linear programming model that the classical power balance generates. Numerical validations in the 33 test feeder with radial and meshed configurations show that the proposed approach effectively minimizes the annual operating costs of the grid. In addition, the GAMS software compares the results of the proposed optimization method, which allows demonstrating its efficiency and robustness.

scholarly journals Optimal Sizing and Placement of Capacitor Banks in Distribution Networks Using a Genetic Algorithm

Electricity ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 187-204
Author(s):  
Gian Giuseppe Soma
Keyword(s):  
Genetic Algorithm ◽  
Electricity Market ◽  
Distribution Systems ◽  
Reactive Power ◽  
Electricity Consumption ◽  
Distribution Networks ◽  
Optimal Placement ◽  
Capacitor Banks ◽  
Control Pattern ◽  
Definition Of

Nowadays, response to electricity consumption growth is mainly supported by efficiency; therefore, this is the new main goal in the development of electric distribution networks, which must fully comply with the system’s constraints. In recent decades, the issue of independent reactive power services, including the optimal placement of capacitors in the grid due to the restructuring of the electricity industry and the creation of a competitive electricity market, has received attention from related companies. In this context, a genetic algorithm is proposed for optimal planning of capacitor banks. A case study derived from a real network, considering the application of suitable daily profiles for loads and generators, to obtain a better representation of the electrical conditions, is discussed in the present paper. The results confirmed that some placement solutions can be obtained with a good compromise between costs and benefits; the adopted benefits are energy losses and power factor infringements, taking into account the network technical limits. The feasibility and effectiveness of the proposed algorithm for optimal placement and sizing of capacitor banks in distribution systems, with the definition of a suitable control pattern, have been proved.

Sign in / Sign up

Export Citation Format

Share Document