Buscar
Mostrando ítems 1-10 de 12016
Multiarea optimal power flow using multiobjective evolutionary algorithm
(2009-12-17)
In this work the multiarea optimal power flow (OPF) problem is decoupled into areas creating a set of regional OPF subproblems. The objective is to solve the optimal dispatch of active and reactive power for a determined ...
Numerical study of the square-root conformation tensor formulation for confined and free-surface viscoelastic fluid flows
(2016-12-01)
We present a numerical study of a stabilization method for computing confined and free-surface flows of highly elastic viscoelastic fluids. In this approach, the constitutive equation based on the conformation tensor, which ...
Substitution-newton-Raphson method for the solution of electric network equations
(2006-12-01)
The power flow problem, in transmission networks, has been well solved, for most cases, using Newton-Raphson method (NR) and its decoupled versions. Generally speaking, the solution of a non-linear system of equations ...
A new solution to the optimal power flow problem
(2001-12-01)
A new approach to solving the Optimal Power Flow problem is described, making use of some recent findings, especially in the area of primal-dual methods for complex programming. In this approach, equality constraints are ...
A new solution to the optimal power flow problem
(2001-12-01)
A new approach to solving the Optimal Power Flow problem is described, making use of some recent findings, especially in the area of primal-dual methods for complex programming. In this approach, equality constraints are ...
Multiarea optimal power flow using multiobjective evolutionary algorithm
(2009-12-17)
In this work the multiarea optimal power flow (OPF) problem is decoupled into areas creating a set of regional OPF subproblems. The objective is to solve the optimal dispatch of active and reactive power for a determined ...
The Non-Permutation Flow-Shop scheduling problem: A literature review
(Pergamon-Elsevier Science Ltd, 2018-06)
The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that ...