Loss minimization by the predictor-corrector modified barrier approach

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

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Improved geometric parameterisation techniques for continuation power flow

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

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

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

Optimization Strategies Based on Sequential Quadratic Programming Applied for a Fermentation Process for Butanol Production

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

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Behavioural Analysis of a Nonlinear Mechanical System Using Transient Trajectories

This work aims at a better comprehension of the features of the solution surface of a dynamical system presenting a numerical procedure based on transient trajectories. For a given set of initial conditions an analysis is made, similar to that of a return map, looking for the new configuration of this set in the first Poincaré sections. The mentioned set of I.C. will result in a curve that can be fitted by a polynomial, i.e. an analytical expression that will be called initial function in the undamped case and transient function in the damped situation. Thus, it is possible to identify using analytical methods the main stable regions of the phase portrait without a long computational time, making easier a global comprehension of the nonlinear dynamics and the corresponding stability analysis of its solutions. This strategy allows foreseeing the dynamic behavior of the system close to the region of fundamental resonance, providing a better visualization of the structure of its phase portrait. The application chosen to present this methodology is a mechanical pendulum driven through a crankshaft that moves horizontally its suspension point.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

A genetic algorithm for crop rotation

In the last few years, crop rotation has gained attention due to its economic, environmental and social importance which explains why it can be highly beneficial for farmers. This paper presents a mathematical model for the Crop Rotation Problem (CRP) that was adapted from literature for this highly complex combinatorial problem. The CRP is devised to find a vegetable planting program that takes into account green fertilization restrictions, the set-aside period, planting restrictions for neighboring lots and for crop sequencing, demand constraints, while, at the same time, maximizing the profitability of the planted area. The main aim of this study is to develop a genetic algorithm and test it in a real context. The genetic algorithm involves a constructive heuristic to build the initial population and the operators of crossover, mutation, migration and elitism. The computational experiment was performed for a medium dimension real planting area with 16 lots, considering 29 crops of 10 different botanical families and a two-year planting rotation. Results showed that the algorithm determined feasible solutions in a reasonable computational time, thus proving its efficacy for dealing with this practical application.

Fast robot voice interface through optimum-path forest

Voice-based user interfaces have been actively pursued aiming to help individuals with motor impairments, providing natural interfaces to communicate with machines. In this work, we have introduced a recent machine learning technique named Optimum-Path Forest (OPF) for voice-based robot interface, which has been demonstrated to be similar to the state-of-the-art pattern recognition techniques, but much faster. Experiments were conducted against Support Vector Machines, Neural Networks and a Bayesian classifier to show the OPF robustness. The proposed architecture provides high accuracy rates allied with low computational times. © 2012 IEEE.

Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

The use of Gramian matrices for aeroelastic stability analysis

Most of the established procedures for analysis of aeroelastic flutter in the development of aircraft are based on frequency domain methods. Proposing new methodologies in this field is always a challenge, because the new methods need to be validated by many experimental procedures. With the interest for new flight control systems and nonlinear behavior of aeroelastic structures, other strategies may be necessary to complete the analysis of such systems. If the aeroelastic model can be written in time domain, using state-space formulation, for instance, then many of the tools used in stability analysis of dynamic systems may be used to help providing an insight into the aeroelastic phenomenon. In this respect, this paper presents a discussion on the use of Gramian matrices to determine conditions of aeroelastic flutter. The main goal of this work is to introduce how observability gramian matrix can be used to identify the system instability. To explain the approach, the theory is outlined and simulations are carried out on two benchmark problems. Results are compared with classical methods to validate the approach and a reduction of computational time is obtained for the second example. © 2013 Douglas Domingues Bueno et al.

Métodos metaheurísticos aplicados a um modelo de planejamento de culturas

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

Estatégias para incorporação das deçisões de sequenciamento em um problema integrado de produção de bebidas

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

Um algoritmo para a construção de superfícies potenciais de falha em sólidos tridimensionais

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