Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

A modified ant colony optimization algorithm modeled on tabu-search methods

An earlier model underlying the foraging strategy of a pachycodyla apicalis ant is modified. The proposed algorithm incorporates key features of the tabu-search method in the development of a relatively simple but robust global ant colony optimization algorithm. Numerical results are reported to validate and demonstrate the feasibility and effectiveness of the proposed algorithm in solving electromagnetic (EM) design problems.

ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM

Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point.

Application of a new reverse Monte Carlo algorithm to polyatomic molecular systems. I. Liquid water

Using a new reverse Monte Carlo algorithm, we present simulations that reproduce very well several structural and thermodynamic properties of liquid water. Both Monte Carlo, molecular dynamics simulations and experimental radial distribution functions used as input are accurately reproduced using a small number of molecules and no external constraints. Ad hoc energy and hydrogen bond analysis show the physical consistency and limitations of the generated RMC configurations. (C) 2001 American Institute of Physics.

Detection and quantification of antibodies to Newcastle disease virus in ostrich and rhea sera using a liquid phase blocking enzyme-linked immunosorbent assay

A liquid phase blocking ELISA (LPB-ELISA) was adapted for the detection and quantification of antibodies to Newcastle disease virus. Sera from vaccinated and unvaccinated commercial flocks of ostriches (Struthio camelus) and rheas (Rhea americana) were tested. The purified and nonpurified virus used as the antigen and the capture and detector antibodies were prepared and standardized for this purpose. The hemagglutination-inhibition (HI) test was regarded as the reference method, the cutoff point for the LPB-ELISA was determined by a two-graph receiver operating characteristic analysis. The LPB-ELISA titers regressed significantly (P < 0.0001) on the HI titers with a high correlation coefficient (r = 0.875). The two tests showed good agreement ( = 0.82; P < 0.0001), relative sensitivity (90.91%) and specificity (91.18%), and accuracy (91.02%), suggesting that they are interchangeable.

An evolutionary algorithm for the one-dimensional cutting stock problem

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

Location and contract pricing of distributed generation using a genetic algorithm

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

Transmission system expansion planning by a branch-and-bound algorithm

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.

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Optimum design of experiments for statistical inference

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

Influence of ankle functional instability on the ankle electromyography during landing after volleyball blocking

The purpose of this study was to describe, interpret and compare the EMG activation patterns of ankle muscles - tibialis anterior (TA), peroneus longus (PL) and gastrocnemius lateralis (GL) - in volleyball players with and without ankle functional instability (FI) during landing after the blocking movement. Twenty-one players with FI (IG) and 19 controls (CG) were studied. The cycle of movement analyzed was the time period between 200 ms before and 200 ms after the time of impact determined by ground reaction forces. The variables were analyzed for two different phases: pre-landing (200 ms before impact) and post-landing (200 ms after impact). The RMS values and the timing of onset activity were calculated for the three studied muscles, in both periods and for both groups. The co-activation index for TA and PL, TA and GL were also calculated. Individuals with FI presented a lower RMS value pre-landing for PL (CG = 43.0 perpendicular to 22.0; IG = 26.2 perpendicular to 8.4, p < 0.05) and higher RMS value post-landing (CG = 47.5 perpendicular to 13.3; IG = 55.8 perpendicular to 21.6, p < 0.10). Besides that, in control group PL and GL activated first and simultaneously, and TA presented a later activation, while in subjects with FI all the three muscles activated simultaneously. There were no significant differences between groups for co-activation index. Thus, the rate of contraction between agonist and antagonist muscles is similar for subjects with and without FI but the activation individually was different. Volleyball players with functional instability of the ankle showed altered patterns of the muscles that play an important role in the stabilization of the foot-ankle complex during the performance of the blocking movement, to the detriment of the ligament complex, and this fact could explain the usual complaints in these subjects. (C) 2007 Elsevier Ltd. All rights reserved.

Pauli blocking and medium effects in nucleon knockout reactions

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

Distribution Transformer Modeling for Application in Three-Phase Power Flow Algorithm

In this paper, it is presented a methodology for three-phase distribution transformer modeling, considering several types of transformer configuration, to be used in algorithms of power flow in three-phase radial distribution networks. The paper provides a detailed discussion about the models and the results from an implementation of the power flow algorithm. The results, taken from three different networks, are presented for several transformer configurations and for voltage regulators as well.

An implementation of modified scatter search algorithm to transmission expansion planning

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