Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Evolutionary optimization applied for fine-tuning parameter estimation in optical flow-based environments

Optical flow methods are accurate algorithms for estimating the displacement and velocity fields of objects in a wide variety of applications, being their performance dependent on the configuration of a set of parameters. Since there is a lack of research that aims to automatically tune such parameters, in this work we have proposed an evolutionary-based framework for such task, thus introducing three techniques for such purpose: Particle Swarm Optimization, Harmony Search and Social-Spider Optimization. The proposed framework has been compared against with the well-known Large Displacement Optical Flow approach, obtaining the best results in three out eight image sequences provided by a public dataset. Additionally, the proposed framework can be used with any other optimization technique.

Abordagens complementares para problemas de p-medianas

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

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

Optimization procedures in the design of continuous induction hardening and tempering installations for magnetic steel bars

An inverse problem concerning the industrial process of steel bars hardening and tempering is considered. The associated optimization problem is formulated in terms of membership functions and, for the sake of comparison, also in terms of quadratic residuals; both geometric and electromagnetic design variables have been considered. The numerical solution is achieved by coupling a finite difference procedure for the calculation of the electromagnetic and thermal fields to a deterministic strategy of minimization based on modified Flctcher and Reeves method. © 1998 IEEE.

Optimal phasor measurement units placement for fault location on overhead electric power distribution feeders

This paper proposes a new approach for optimal phasor measurement units placement for fault location on electric power distribution systems using Greedy Randomized Adaptive Search Procedure metaheuristic and Monte Carlo simulation. The optimized placement model herein proposed is a general methodology that can be used to place devices aiming to record the voltage sag magnitudes for any fault location algorithm that uses voltage information measured at a limited set of nodes along the feeder. An overhead, three-phase, three-wire, 13.8 kV, 134-node, real-life feeder model is used to evaluate the algorithm. Tests show that the results of the fault location methodology were improved thanks to the new optimized allocation of the meters pinpointed using this methodology. © 2011 IEEE.

Optimizing feature selection through binary charged system search

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be inviable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the Charged System Search (CSS), which has never been applied to this context so far. The wrapper approach combines the power of exploration of CSS together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in four public datasets have demonstrated the validity of the proposed approach can outperform some well-known swarm-based techniques. © 2013 Springer-Verlag.

Planejamento da expansão de sistemas de transmissão usando a metaheurística de busca em vizinhança variável

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

Práticas de leitura e escrita em contexto acadêmico: relações (hiper)textuais singulares

The present article aims at reflecting about the discursive practices of writing and reading on the net, more specifically about the writing and reading methods used by the undergraduate and graduated teachers, based on an internet search engine. It’s of interest to investigate: i) the (hyper) textual relations established in the context thought as permitted by the electronic resources; ii) the discursive marks that arise (are arisen) in a singular way of reading (and/or writing). The set of material was produced during a university extension course about reading and cyberspace, whose context consisted of a drawing production of the reading process on an internet search engine, on the basis of the signifier “apple”. Based on the French Discourse Analysis and assumptions from the New Literacy Studies, we intended to discuss the operating procedures of the internet search and the effects of meanings produced by the subject during his/her reading/writing process.

On the optical flow model selection through metaheuristics

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

Profiling the Proteome of the Venom from the Social Wasp Polybia paulista: A Clue to Understand the Envenoming Mechanism

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

Immunodominant Antigens of Leishmania chagasi Associated with Protection against Human Visceral Leishmaniasis

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

Técnicas multivariadas na determinação da diversidade genética em gergelim usando marcadores RAPD

O objetivo deste trabalho foi comparar diferentes técnicas multivariadas na caracterização de 35 genótipos de gergelim mediante 769 marcadores RAPD. As distâncias genéticas foram obtidas pelo complemento aritmético do coeficiente de Jaccard e agrupadas pelos métodos hierárquicos do vizinho mais próximo, do vizinho mais distante, das médias aritméticas não ponderadas (UPGMA), do método de otimização de Tocher e análises de coordenadas principais. O agrupamento dos genótipos foi alterado em função dos diferentes métodos usados. Adotando-se a mesma distância genética (0,36) como valor de corte, diferenciaram-se quatro grupos no método do vizinho mais próximo, 13 para o vizinho mais distante, 11 no UPGMA e quatro no Tocher. Entre os métodos hierárquicos, o UPGMA apresentou o melhor ajuste das distâncias originais e estimadas (CCC = 0,89). As análises das coordenadas principais confirmaram a baixa diversidade existente entre os genótipos. A maior divergência ocorreu entre as cultivares Seridó 1 e Arawaca 4, e a menor, entre os genótipos VCR-101 e GP-3314. As três primeiras coordenadas principais contabilizaram 35,13% do total da variabilidade, e 18 autovalores foram necessários para explicar 81% da variação genética. Os métodos UPGMA, de otimização de Tocher, e as análises de coordenadas principais são complementares na formação dos grupos.

O problema de corte de placas defeituosas

O problema tratado neste trabalho consiste em cortar uma placa retangular em peças menores retangulares, de modo que a perda seja minimizada. A placa, entretanto, contém defeitos bem localizados. Propomos uma abordagem em grafo E/OU para representação das soluções possíveis e um método de enumeração implícita para determinar a solução ótima. Resultados computacionais demonstram a efetividade da abordagem.