Search schemes for random optimization algorithms that preserve the asymptotic distribution

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case.

Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System

In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.

Allocation of protective devices in distribution circuits using nonlinear programming models and genetic algorithms

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.

Using Amino Acid Correlation and Community Detection Algorithms to Identify Functional Determinants in Protein Families

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

Use of genetic algorithms and solvation potential to study peptides structure

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains and implicit solvation potential are used to optimize the tertiary structure of peptides. We starting from the known PDB structure of its backbone which is kept fixed while the side chains allowed adopting the conformations present in the rotamer library. It was used rotamer library independent of backbone and a implicit solvation potential. The structure of Mastoporan-X was predicted using several force fields with a growing complexity; we started it with a field where the only present interaction was Lennard-Jones. We added the Coulombian term and we considered the solvation effects through a term proportional to the solvent accessible area. This paper present good and interesting results obtained using the potential with solvation term and rotamer library. Hence, the algorithm (called YODA) presented here can be a good tool to the prediction problem. (c) 2007 Elsevier B.V. All rights reserved.

Short-time dynamics of percolation observables

We consider the critical short-time evolution of magnetic and droplet-percolation order parameters for the Ising model in two and three dimensions, through Monte Carlo simulations with the (local) heat-bath method. We find qualitatively different dynamic behaviors for the two types of order parameters. More precisely, we find that the percolation order parameter does not have a power-law behavior as encountered for the magnetization, but develops a scale (related to the relaxation time to equilibrium) in the Monte Carlo time. We argue that this difference is due to the difficulty in forming large clusters at the early stages of the evolution. Our results show that, although the descriptions in terms of magnetic and percolation order parameters may be equivalent in the equilibrium regime, greater care must be taken to interpret percolation observables at short times. In particular, this concerns the attempts to describe the dynamics of the deconfinement phase transition in QCD using cluster observables.

Dynamic critical behavior of percolation observables in the 2d Ising model

We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two-dimensional Ising model. We consider the (Monte-Carlo) short-time evolution of the system obtained with a local heat-bath method and with the global Swendsen-Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and Omega, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.

Percolation of Monte Carlo clusters

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

The Chemical Percolation Devolatilization Model Applied to the Devolatilization of Coal in High Intensity Acoustic Fields

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

ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.

On the dissimilarity between the algorithms for computing the symmetric energy-momentum tensor in ordinary field theory and general relativity

The recipe used to compute the symmetric energy-momentum tensor in the framework of ordinary field theory bears little resemblance to that used in the context of general relativity, if any. We show that if one stal ts fi om the field equations instead of the Lagrangian density, one obtains a unified algorithm for computing the symmetric energy-momentum tensor in the sense that it can be used for both usual field theory and general relativity.

Electrical percolation during gelation of lithium doped siloxane-poly(oxyethylene) hybrids

Gelation mechanisms of lithium-doped Siloxane-Poly(oxyethylene) (PEO) hybrids containing polymer of two different molecular weight (500 and 1900 g/mol) were investigated through the evolution of the electrical properties during the solgel transition. The results of electrical measurements, performed by in-situ complex impedance spectroscopy, were correlated with the coordination and the dynamical properties of the lithium ions during the process as shown by Li-7 NMR measurements. For both hybrids sols, a decrease of the conductivity is observed at the initial gelation stage, due to the existence of an inverted percolation process consisting of the progressive separation of solvent molecules containing conducting species in isolated islands during the solid network formation. An increase of conductivity occurs at more advanced stages of gelation and aging, attributed to the increasing connectivity between PEO chains promoted by the formation of crosslinks of siloxane particles at their extremities, favoring hopping motions of lithium ions along the chains.

Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.