Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem

A new approach for solving the optimal power flow (OPF) problem is established by combining the reduced gradient method and the augmented Lagrangian method with barriers and exploring specific characteristics of the relations between the variables of the OPF problem. Computer simulations on IEEE 14-bus and IEEE 30-bus test systems illustrate the method. (c) 2007 Elsevier Inc. All rights reserved.

DC traction load flow including AC distribution network

In the first part some information and characterisation about an AC distribution network that feeds traction substations and their possible influences on the DC traction load flow are presented. Those influences are investigated and mathematically modelled. To corroborate the mathematical model, an example is presented and their results are confronted with real measurements.

FORCED CONVECTION TO LAMINAR FLOW OF LIQUID EGG YOLK IN CIRCULAR AND ANNULAR DUCTS

The steady-state heat transfer in laminar flow of liquid egg yolk - an important pseudoplastic fluid food - in circular and concentric annular ducts was experimentally investigated. The average convection heat transfer coefficients, determined by measuring temperatures before and after heating sections with constant temperatures at the tube wall, were used to obtain simple new empirical expressions to estimate the Nusselt numbers for fully established flows at the thermal entrance of the considered geometries. The comparisons with existing correlations for Newtonian and non-Newtonian fluids resulted in excellent agreement. The main contribution of this work is to supply practical and easily applicable correlations, which are, especially for the case of annulus, rather scarce and extensively required in the design of heat transfer operations dealing with similar shear-thinning products. In addition, the experimental results may support existing theoretical analyses.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.