25 resultados para Style branch

em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"


Relevância:

60.00% 60.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies; the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances. (C) 2004 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The human buccal micronucleus cytome assay (BMCyt) is one of the most widely used techniques to measure genetic damage in human population studies. Reducing protocol variability, assessing the role of confounders, and estimating a range of reference values are research priorities that will be addressed by the HUMNXL, collaborative study. The HUMNXL, project evaluates the impact of host factors, occupation, life-style, disease status, and protocol features on the occurrence of MN in exfoliated buccal cells. In addition, the study will provide a range of reference values for all cytome endpoints. A database of 5424 subjects with buccal MN values obtained from 30 laboratories worldwide was compiled and analyzed to investigate the influence of several conditions affecting MN frequency. Random effects models were mostly used to investigate MN predictors. The estimated spontaneous MN frequency was 0.74 parts per thousand (95% CI 0.52-1.05). Only staining among technical features influenced MN frequency, with an abnormal increase for non-DNA-specific stains. No effect of gender was evident, while the trend for age was highly significant (p < 0.001). Most occupational exposures and a diagnosis of cancer significantly increased MN and other endpoints frequencies. MN frequency increased in heavy smoking (>= 40 cig/day. FR = 1.37:95% CI 1.03-.82) and decreased with daily fruit consumption (FR = 0.68; 95% CI 0.50-0.91). The results of the HUMNXL, project identified priorities for validation studies, increased the basic knowledge of the assay, and contributed to the creation of a laboratory network which in perspective may allow the evaluation of disease risk associated with MN frequency. (C) 2011 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the management branch model where the random resources of the subsystem are given by the exponential distributions. The determinate equivalent is a block structure problem of quadratic programming. It is solved effectively by means of the decomposition method, which is based on iterative aggregation. The aggregation problem of the upper level is resolved analytically. This overcomes all difficulties concerning the large dimension of the main problem.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The conventional Newton's method is considered to be inadequate for the computation of the maximum loading point (MLP) of power systems since: (i) it encounters difficulties in the vicinity of the MLP: and (ii) the load flow Jacobian matrix becomes singular at the MLP. It is well known that continuation methods are powerful and useful tools that are able to trace the solution PV curve without experiencing such diffculties. However, continuation methods require a parameterisation so that a modified, well conditioned set of load flow equations is obtained. In particular, the Jacobian matrix associated with this modified set of equations should not be singular at the MLP. The authors propose that the actual power losses in transmission branches (lines and transformers) are used to parameterise the approach. Specific procedures for the automatic determination of the most appropriate parameter (branch) are proposed. Such procedures include the utilisation of fast voltage-stability indices. Simulation results are presented to show that the proposed method is able to trace the whole solution PV curve very efficiently.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper is part of the special publication Continental transpressional and transtensional tectonics (eds R.E. Holdsworth, R.A. Strachan and J.F. Dewey). Two orogenic belts have been recognized in south- east Brazil, which are interpreted to have been formed as a product of diachronous collisions between three continental plates. Wide crustal-scale shear belts have developed both between and inboard of the collided and amalgamated plate borders. These shear belts record frontal, oblique or lateral displacements during oblique plate convergence and A-type subduction. The overall structural style of each belt depends on the angle subtended between the plate boundary and the convergence vector. The E-W branch between the Sao Paulo and Brasilia plates the Campo do Meio strike-slip shear belt, has undergone dominantly sinistral wrench dominated transpression along a set of folds and shear zones dipping southwards. The NE-SW branch between the Sao Paulo and Vitoria plates, the Paraiba do Sul strike-slip shear belt, has undergone a partitioned dextral transpression, whereas the north-south branch between the Brasilia and Vitoria plates is essentially a frontal thrust system with only a weak component of dextral strike-slip. These complex structural patterns, formed at deep to mid-crustal levels, reflect temporal and spatial partitioning at all scales between flattening and non- coaxial deformation, and down-dip and strike-slip shearing, in tangential as well as in transcurrent structural domains. Additionally, this area demonstrates that regional flower structures, lateral extrusion and other secondary deformations across the yz sections of transpressional belts are important in accommodating shortening in obliquely convergent orogens.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the reactive power planning in electric energy systems. The Benders decomposition separates the planning problem into two subproblems: an investment subproblem (master) and the operation subproblem (slave), which are solved alternately. The operation subproblem is solved using a successive linear programming (SLP) algorithm while the investment subproblem, which is an integer linear programming (ILP) problem with discrete variables, is resolved using a Branch and Bound algorithm especially developed to resolve this type of problem.