28 resultados para General allocation problems

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


Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

90.00% 90.00%

Publicador:

Resumo:

This paper presents a mixed-integer linear programming model to solve the problem of allocating voltage regulators and fixed or switched capacitors (VRCs) in radial distribution systems. The use of a mixed-integer linear model guarantees convergence to optimality using existing optimization software. In the proposed model, the steady-state operation of the radial distribution system is modeled through linear expressions. The results of one test system and one real distribution system are presented in order to show the accuracy as well as the efficiency of the proposed solution technique. An heuristic to obtain the Pareto front for the multiobjective VRCs allocation problem is also presented. © 2012 Elsevier Ltd. All rights reserved.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Distribution networks paradigm is changing currently requiring improved methodologies and tools for network analysis and planning. A relevant issue is analyzing the impact of the Distributed Generation penetration in passive networks considering different operation scenarios. Studying DG optimal siting and sizing the planner can identify the network behavior in presence of DG. Many approaches for the optimal DG allocation problem successfully used multi-objective optimization techniques. So this paper contributes to the fundamental stage of multi-objective optimization of finding the Pareto optimal solutions set. It is proposed the application of a Multi-objective Tabu Search and it was verified a better performance comparing to the NSGA-II method. © 2009 IEEE.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

One of the key issues which makes the waveletGalerkin method unsuitable for solving general electromagnetic problems is a lack of exact representations of the connection coefficients. This paper presents the mathematical formulae and computer procedures for computing some common connection coefficients. The characteristic of the present formulae and procedures is that the arbitrary point values of the connection coefficients, rather than the dyadic point values, can be determined. A numerical example is also given to demonstrate the feasibility of using the wavelet-Galerkin method to solve engineering field problems. © 2000 IEEE.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this work, motivated by non-ideal mechanical systems, we investigate the following O.D.E. ẋ = f (x) + εg (x, t) + ε2g (x, t, ε), where x ∈ Ω ⊂ ℝn, g, g are T periodic functions of t and there is a 0 ∈ Ω such that f (a 0) = 0 and f′ (a0) is a nilpotent matrix. When n = 3 and f (x) = (0, q (x 3) , 0) we get results on existence and stability of periodic orbits. We apply these results in a non ideal mechanical system: the Centrifugal Vibrator. We make a stability analysis of this dynamical system and get a characterization of the Sommerfeld Effect as a bifurcation of periodic orbits. © 2007 Birkhäuser Verlag, Basel.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The optimized allocation of protective devices in strategic points of the circuit improves the quality of the energy supply and the system reliability index. This paper presents a nonlinear integer programming (NLIP) model with binary variables, to deal with the problem of protective device allocation in the main feeder and all branches of an overhead distribution circuit, to improve the reliability index and to provide customers with service of high quality and reliability. The constraints considered in the problem take into account technical and economical limitations, such as coordination problems of serial protective devices, available equipment, the importance of the feeder and the circuit topology. The use of genetic algorithms (GAs) is proposed to solve this problem, using a binary representation that does (1) or does not (0) show allocation of protective devices (reclosers, sectionalizers and fuses) in predefined points of the circuit. Results are presented for a real circuit (134 busses), with the possibility of protective device allocation in 29 points. Also the ability of the algorithm in finding good solutions while improving significantly the indicators of reliability is shown. (C) 2003 Elsevier B.V. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

An iterated deferred correction algorithm based on Lobatto Runge-Kutta formulae is developed for the efficient numerical solution of nonlinear stiff two-point boundary value problems. An analysis of the stability properties of general deferred correction schemes which are based on implicit Runge-Kutta methods is given and results which are analogous to those obtained for initial value problems are derived. A revised definition of symmetry is presented and this ensures that each deferred correction produces an optimal increase in order. Finally, some numerical results are given to demonstrate the superior performance of Lobatto formulae compared with mono-implicit formulae on stiff two-point boundary value problems. (C) 1998 Elsevier B.V. Ltd. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

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

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A simple proof is given that a 2 x 2 matrix scheme for an inverse scattering transform method for integrable equations can be converted into the standard form of the second-order scalar spectral problem associated with the same equations. Simple formulae relating these two kinds of representation of integrable equations are established.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this paper we present an extension to the nonplanar case of the asymmetric expansion of the averaged resonant disturbing function of Ferraz-Mello & Sato (1989, A&A 225, 541-547). Comparions with the exact averaged disturbing function are also presented. The expansion gives a good approximation of the exact function in a wide region around the center of expansion.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We propose to employ deformed commutation relations to treat many-body problems of composite particles. The deformation parameter is interpreted as a measure of the effects of the statistics of the internal degrees of freedom of the composite particles. A simple application of the method is made for the case of a gas of composite bosons.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Many variational inequality problems (VIPs) can be reduced, by a compactification procedure, to a VIP on the canonical simplex. Reformulations of this problem are studied, including smooth reformulations with simple constraints and unconstrained reformulations based on the penalized Fischer-Burmeister function. It is proved that bounded level set results hold for these reformulations under quite general assumptions on the operator. Therefore, it can be guaranteed that minimization algorithms generate bounded sequences and, under monotonicity conditions, these algorithms necessarily nd solutions of the original problem. Some numerical experiments are presented.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.