Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.

On a regular convex solver potential for an elastic-damage constitutive model: a theoretical analysis

This work is related with the proposition of a so-called regular or convex solver potential to be used in numerical simulations involving a certain class of constitutive elastic-damage models. All the mathematical aspects involved are based on convex analysis, which is employed aiming a consistent variational formulation of the potential and its conjugate one. It is shown that the constitutive relations for the class of damage models here considered can be derived from the solver potentials by means of sub-differentials sets. The optimality conditions of the resulting minimisation problem represent in particular a linear complementarity problem. Finally, a simple example is present in order to illustrate the possible integration errors that can be generated when finite step analysis is performed. (C) 2003 Elsevier Ltd. All rights reserved.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

A neural network-based preset generation tool for a steel tandem cold mill

This paper traces the development of a software tool, based oil a combination of artificial neural networks (ANN) and a few process equations. aiming to serve as a backup operation instrument in the reference generation for real-time controllers of a steel tandem cold mill By emulating the mathematical model responsible for generating presets under normal operational conditions, the system works as ail option to maintain plant operation in the event of a failure in the processing unit that executes the mathematical model. The system, built from the production data collected over six years of plant operation, steered to the replacement of the former backup operation mode (based oil a lookup table). which degraded both product quality and plant productivity. The study showed that ANN are appropriated tools for the intended purpose and that by this instrument it is possible to achieve nearly the totality of the presets needed by this land of process. The text characterizes the problem, relates the investigated options to solve it. justifies the choice of the ANN approach, describes the methodology and system implementation and, finally, shows and discusses the attained results. (C) 2009 Elsevier Ltd. All rights reserved

Optimal Contract Pricing of Distributed Generation in Distribution Networks

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

A New and Fast Technique to Generate Offspring after Germ Cells Transplantation in Adult Fish: The Nile Tilapia (Oreochromis niloticus) Model

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Proteins of Leishmania (Viannia) shawi confer protection associated with Th1 immune response and memory generation

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Application of a model updating technique for health condition monitoring and damage detection of flexible structures

This paper discusses the application of a damage detection methodology to monitor the location and extent of partial structural damage. The methodology combines, in an iterative way, the model updating technique based on frequency response functions (FRF) with monitoring data aiming at identifying the damage area of the structure. After the updating procedure reaches a good correlation between the models, it compares the parameters of the damage structure with those of the undamaged one to find the deteriorated area. The influence of the FEM mesh size on the evaluation of the extent of the damage has also been discussed. The methodology is applied using real experimental data from a spatial frame structure.

Compatibility of a model for the QCD-Pomeron and chiral-symmetry breaking phenomenologies

The phenomenology of a QCD-Pomeron model based on the exchange of a pair of non-perturbative gluons, i.e. gluon fields with a finite correlation length in the vacuum, is studied in comparison with the phenomenology of QCD chiral symmetry breaking, based on non-perturbative solutions of Schwinger-Dyson equations for the quark propagator including these non-perturbative gluon effects. We show that these models are incompatible, and point out some possibles origins of this problem.

Critical coupling for dynamical chiral-symmetry breaking with an infrared finite gluon propagator

We compute the critical coupling constant for the dynamical chiral-symmetry breaking in a model of quantum chromodynamics, solving numerically the quark self-energy using infrared finite gluon propagators found as solutions of the Schwinger-Dyson equation for the gluon, and one gluon propagator determined in numerical lattice simulations. The gluon mass scale screens the force responsible for the chiral breaking, and the transition occurs only for a larger critical coupling constant than the one obtained with the perturbative propagator. The critical coupling shows a great sensibility to the gluon mass scale variation, as well as to the functional form of the gluon propagator.

Chiral parameters in a QCD-motivated model with confined and massive gluons

A one parameter model of a confined-gluon propagator has been formulated by Frank and Roberts recently, which has a great success explaining π - and p - meson observables. We show, computing few chiral parameters, that a small variation of this model considering an infrared finite gluon propagator with a dynamically generated gluon mass, can also fit data related to the chiral symmetry breaking. This allows a direct interpretation for the unique parameter involved in the model as the gluon mass scale. © 1998 Elsevier Science B.V. All rights reserved.

Fock terms in the quark-meson coupling model

The mean field description of nuclear matter in the quark-meson coupling model is improved by the inclusion of exchange contributions (Fock terms). The inclusion of Fock terms allows us to explore the momentum dependence of meson-nucleon vertices and the role of pionic degrees of freedom in matter. It is found that the Fock terms maintain the previous predictions of the model for the in-medium properties of the nucleon and for the nuclear incompressibility. The Fock terms significantly increase the absolute values of the single-particle, four-component scalar and vector potentials, a feature that is relevant for the spin-orbit splitting in finite nuclei. © 1999 Elsevier Science B.V.

Causal theory for the gauged Thirring model

We consider the (2 + 1)-dimensional massive Thirring model as a gauge theory, with one-fermion flavor, in the framework of the causal perturbation theory and address the problem of dynamical mass generation for the gauge boson. In this context we obtain an unambiguous expression for the coefficient of the induced Chern-Simons term.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.