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)

Optimisation of a fermentation process for butanol production by particle swarm optimisation (PSO)

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

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.

Framework for analysis and representation of external systems for online reactive-optimisation studies

The paper proposes a framework for the analysis and representation of external systems for online optimisation studies. The basis for this framework is the equivalent OPF (EOPF), an optimisation model obtained by partitioning of the OPF model. The EOPF is mathematically redefined in the paper to accommodate the concept of a buffer zone. The resulting model is more useful for online optimisation, since external information obtained through intercontrol-centre exchange contracts can be used to improve internal control calculation. Numerical results obtained with original studies involving the boundary-matching procedure have provided a conceptual basis for the definition of a buffer zone for optimisation studies with the EOPF. In the proposed framework, the accuracy of the external representation in optimisation studies is evaluated by comparing the controls obtained by an EOPF procedure with those obtained by the reference-optimisation procedure defined in this paper. The framework is then used to evaluate the accuracy of equivalent optimisation studies involving the IEEE 118-bus test system and the Brazilian South Southeast 810-bus system. The results show that the incorporation of a buffer zone improves the external system representation for all optimisation studies performed.

Optimisation of environmental gas cleaning routes for solid wastes cogeneration systems. Part II - Analysis of waste incineration combined gas/steam cycle

In the first paper of this paper (Part I), conditions were presented for the gas cleaning technological route for environomic optimisation of a cogeneration system based in a thermal cycle with municipal solid waste incineration. In this second part, an environomic analysis is presented of a cogeneration system comprising a combined cycle composed of a gas cycle burning natural gas with a heat recovery steam generator with no supplementary burning and a steam cycle burning municipal solid wastes (MSW) to which will be added a pure back pressure steam turbine (another one) of pure condensation. This analysis aims to select, concerning some scenarios, the best atmospheric pollutant emission control routes (rc) according to the investment cost minimisation, operation and social damage criteria. In this study, a comparison is also performed with the results obtained in the Case Study presented in Part I. (c) 2007 Elsevier Ltd. All rights reserved.

Optimisation of environmental gas cleaning routes for solid wastes cogeneration systems - Part I - Analysis of waste incineration steam cycle

Research of advanced technologies for energy generation contemplates a series of alternatives that are introduced both in the investigation of new energy sources and in the improvement and/or development of new components and systems. Even though significant reductions are observed in the amount of emissions, the proposed alternatives require the use of exhaust gases cleaning systems. The results of environmental analyses based on two configurations proposed for urban waste incineration are presented in this paper; the annexation of integer (Boolean) variables to the environomic model makes it possible to define the best gas cleaning routes based on exergetic cost minimisation criteria. In this first part, the results for steam cogeneration system analysis associated with the incineration of municipal solid wastes (MSW) is presented. (c) 2007 Elsevier Ltd. All rights reserved.

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.

Transmission system expansion planning by an extended genetic algorithm

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

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)

Optimisation of a continuous flash fermentation for butanol production using the response surface methodology

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.

Optimisation of the glycerol-to-ornithine molar ratio in the feed medium for the continuous production of clavulanic acid by Streptomyces clavuligerus

Amino acids are well metabolized by Streptomyces clavuligerus during the production of clavulanic acid using glycerol as main carbon and energy source. However, only a few amino acids such as arginine and ornithine are favorable for CA biosynthesis. The aim of this work was to optimize the glycerol:ornithine molar ratio in the feed medium containing only these compounds to maximize CA production in continuous cultivation. A minimum number of experiments were performed by means of a simple two-level full-factorial central composite design to investigate the combined effect of glycerol and ornithine feeding on the CA concentration during the intermittent and continuous process in shake-flasks. Statistical analysis of the experimental data using the response surface methodology showed that a glycerol-to-ornithine molar ratio of approximately 40:1 in the feed medium resulted in the highest CA concentration when fermentation was stopped. Under these optimized conditions, in bench-scale fermentor runs, the CA concentration reached more than double the concentration obtained in shake-flasks runs. (C) 2009 Elsevier B.V. All rights reserved.

Métodos de geração de colunas para problemas de atribuição

Este trabalho apresenta métodos de geração de colunas para dois importantes problemas de atribuição: o Problema Generalizado de Atribuição (PGA) e o Problema de Atribuição de Antenas a Comutadores (PAAC). O PGA é um dos mais representativos problemas de Otimização Combinatória e consiste em otimizar a atribuição de n tarefas a m agentes, de forma que cada tarefa seja atribuída a exatamente um agente e a capacidade de cada agente seja respeitada. O PAAC consiste em atribuir n antenas a m comutadores em uma rede de telefonia celular, de forma a minimizar os custos de cabeamento entre antenas e comutadores e os custos de transferência de chamadas entre comutadores. A abordagem tradicional de geração de colunas é comparada com as propostas neste trabalho, que utilizam a relaxação lagrangeana/surrogate. São apresentados testes computacionais que demonstram a efetividade dos algoritmos propostos.