Modelagem generalizada do problema de planejamento da expansão de sistemas de transmissão

Pós-graduação em Engenharia Elétrica - FEIS

Otimização combinatória para alocação de fontes renováveis em microrredes de corrente contínua

Pós-graduação em Engenharia Elétrica - FEIS

A bi-objective genetic approach for the selection of sugarcane varieties to comply with environmental and economic requirements

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

Birth of limit cycles bifurcating from a nonsmooth center

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

A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem

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

Optimal Reactive Power Planning Using Risk Analysis

In this paper, the optimal reactive power planning problem under risk is presented. The classical mixed-integer nonlinear model for reactive power planning is expanded into two stage stochastic model considering risk. This new model considers uncertainty on the demand load. The risk is quantified by a factor introduced into the objective function and is identified as the variance of the random variables. Finally numerical results illustrate the performance of the proposed model, that is applied to IEEE 30-bus test system to determine optimal amount and location for reactive power expansion.

Das transformadas integrais ao cálculo fracionário aplicado à equação logística

Pós-graduação em Biometria - IBB

A genetic algorithm for the one-dimensional cutting stock problem with setups

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

APPROXIMATE CALCULATION OF SUMS I: BOUNDS FOR THE ZEROS OF GRAM POLYNOMIALS

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

A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem

In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.

Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.

Resolução de problema de valor no contorno associado ao projeto de reatores de fluxo disperso empregados no tratamento de efluentes

The objective of this work was to develop a numerical method to solve boundary value problems concerning to the use of dispersion model for describing the hydraulic behavior of chemical or biological reactors employed in the wastewater treatment. The numerical method was implemented in FORTRAN language generating a computational program which was applied to solve cases involving reaction kinetics of both integer and fractional orders. The developed method was able to solve the proposed problems evidencing to be a useful tool that provides more accurate design of wastewater treatment reactors

Dinâmica de rotação de exoplanetas tipo terrestre com perturbação de terceiro corpo

In this work we study some topics of Celestial Mechanics, namely the problem of rigid body rotation and “spin-orbit” resonances. Emphasis is placed on the problem formulation and applications to some exoplanets with physical parameters (e.g. mass and radius) compatible with a terrestrial type constitution (e.g. rock) belonging to multiple planetary systems. The approach is both analytical and numerical. The analytical part consists of: i) the deduction of the equation of motion for the rotation problem of a spherical body with no symmetry, disturbed by a central body; ii) modeling the same problem by including a third-body in the planet-star system; iii) formulation of the concept of “spin-orbit” resonance in which the orbital period of the planet is an integer multiple of the rotation’s period. Topics of dynamical systems (e.g. equilibrium points, chaos, surface sections, etc.) will be included at this stage. In the numerical part simulations are performed with numerical models developed in the previous analytical section. As a first step we consider the orbit of the planet not perturbed by a third-body in the star-planet system. In this case the eccentricity and orbital semi-major axis of the planet are constants. Here the technique of surface sections, widely used in dynamical systems are applied. Next, we consider the action of a third body, developing a more realistic model for planetary rotation. The results in both cases are compared. Since the technique of disturbed surface sections is no longer applicable, we quantitatively evaluate the evolution of the characteristic angles of rotation (e.g. physical libration) by studying the evolution of individual orbits in the dynamically important regions of phase space, the latter obtained in the undisturbed case

Um problema de corte de estoque multiobjetivo

In this paper we deal with the one-dimensional integer cutting stock problem, which consists of cutting a set of available objects in stock in order to produce ordered smaller items in such a way as to optimize a given objective function, which in this paper is composed of three different objectives: minimization of the number of objects to be cut (raw material), minimization of the number of different cutting patterns (setup time), minimization of the number of saw cycles (optimization of the saw productivity). For solving this complex problem we adopt a multiobjective approach in which we adapt, for the problem studied, a symbiotic genetic algorithm proposed in the literature. Some theoretical and computational results are presented.

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.