Active security-constrained optimal power flow using modified Hopfield neural network

A Hopfield neural network is modified to handle inequality constraints by introducing an exterior penalty function. The use of a penalty function converts constrained optimization problems into unconstrained problems.; The optimal power flow is a general non-linear programming problem with a non-linear objective function and non-linear functional equality and inequality constraints. Security Constrained Dispatch is defined as an Optimal Power Flow problem, in which the objective function is the total cost of generations and the security constraints are placed on the bus voltage magnitudes, phase angles and the generated active powers.; This thesis presents an alternative method for solving optimal active power flow and active security-constrained dispatch using a modified Hopfield neural network. The objective function of security-constrained dispatch is the incremental generation cost function in quadratic form which is expanded in a second-order Taylor series. The equality and inequality constraints are modelled using a linearized network and appended to the objective function using suitable penalty functions to form an augmented cost function.; The goal of this research is to model and study the applicability of the modified Hopfield Neural Network for solving optimal active power flow and security-constrained dispatch problem. In addition, this thesis aims to discover the advantages and disadvantages of using this technique instead of the methods that currently exist.; The Hopfield Neural Network was simulated on a digital computer for four standard IEEE test systems varying in size from a 5-bus system to a 57-bus system. The optimal solution obtained using this approach is consistent with the solution obtained using the conventional method.; The advantage of this method is in the ease of formalization of the problem. It is simple, straightforward, and easy to apply. The method requires modest memory resources and is efficient in computation time. This representation is applicable to many problems other than the economic load-dispatching problem.