Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design

This paper describes the formulation of a Multi-objective Pipe Smoothing Genetic Algorithm (MOPSGA) and its application to the least cost water distribution network design problem. Evolutionary Algorithms have been widely utilised for the optimisation of both theoretical and real-world non-linear optimisation problems, including water system design and maintenance problems. In this work we present a pipe smoothing based approach to the creation and mutation of chromosomes which utilises engineering expertise with the view to increasing the performance of the algorithm whilst promoting engineering feasibility within the population of solutions. MOPSGA is based upon the standard Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and incorporates a modified population initialiser and mutation operator which directly targets elements of a network with the aim to increase network smoothness (in terms of progression from one diameter to the next) using network element awareness and an elementary heuristic. The pipe smoothing heuristic used in this algorithm is based upon a fundamental principle employed by water system engineers when designing water distribution pipe networks where the diameter of any pipe is never greater than the sum of the diameters of the pipes directly upstream resulting in the transition from large to small diameters from source to the extremities of the network. MOPSGA is assessed on a number of water distribution network benchmarks from the literature including some real-world based, large scale systems. The performance of MOPSGA is directly compared to that of NSGA-II with regard to solution quality, engineering feasibility (network smoothness) and computational efficiency. MOPSGA is shown to promote both engineering and hydraulic feasibility whilst attaining good infrastructure costs compared to NSGA-II.

On certain geometric aspects of portfolio optimisation with higher moments

We discuss geometric properties related to the minimisation of a portfolio kurtosis given its first two odd moments, considering a risk-less asset and allowing for short sales. The findings are generalised for the minimisation of any given even portfolio moment with fixed excess return and skewness, and then for the case in which only excess return is constrained. An example with two risky assets provides a better insight on the problems related to the solutions. The importance of the geometric properties and their use in the higher moments portfolio choice context is highlighted.

Optimisation of stir bar sorptive extraction and liquid desorption combined with large volume injection-gas chromatography–quadrupole mass spectrometry for the determination of volatile compounds in wines

Stir bar sorptive extraction and liquid desorption followed by large volume injection coupled to gas chromatography–quadrupole mass spectrometry (SBSE–LD/LVI-GC–qMS) had been applied for the determination of volatiles in wines. The methodology was optimised in terms of extraction time and influence of ethanol in the matrix; LD conditions, and instrumental settings. The optimisation was carried out by using 10 standards representative of the main chemical families of wine, i.e. guaiazulene, E,E-farnesol, β-ionone, geranylacetone, ethyl decanoate, β-citronellol, 2-phenylethanol, linalool, hexyl acetate and hexanol. The methodology shows good linearity over the concentration range tested, with correlation coefficients higher than 0.9821, a good reproducibility was attained (8.9–17.8%), and low detection limits were achieved for nine volatile compounds (0.05–9.09 μg L−1), with the exception of 2-phenylethanol due to low recovery by SBSE. The analytical ability of the SBSE–LD/LVI-GC–qMS methodology was tested in real matrices, such as sparkling and table wines using analytical curves prepared by using the 10 standards where each one was applied to quantify the structurally related compounds. This methodology allowed, in a single run, the quantification of 67 wine volatiles at levels lower than their respective olfactory thresholds. The proposed methodology demonstrated to be easy to work-up, reliable, sensitive and with low sample requirement to monitor the volatile fraction of wine.

Optimisation of solid-phase microextraction combined with gas chromatography–mass spectrometry based methodology to establish the global volatile signature in pulp and skin of Vitis vinifera L. grape varieties

The volatiles (VOCs) and semi-volatile organic compounds (SVOCs) responsible for aroma are mainly present in skin of grape varieties. Thus, the present investigation is directed towards the optimisation of a solvent free methodology based on headspace-solid-phase microextraction (HS-SPME) combined with gas chromatography–quadrupole mass spectrometry (GC–qMS) in order to establish the global volatile composition in pulp and skin of Bual and Bastardo Vitis vinifera L. varieties. A deep study on the extraction-influencing parameters was performed, and the best results, expressed as GC peak area, number of identified compounds and reproducibility, were obtained using 4 g of sample homogenised in 5 mL of ultra-pure Milli-Q water in a 20 mL glass vial with addition of 2 g of sodium chloride (NaCl). A divinylbenzene/carboxen/polydimethylsiloxane fibre was selected for extraction at 60 °C for 45 min under continuous stirring at 800 rpm. More than 100 VOCs and SVOCs, including 27 monoterpenoids, 27 sesquiterpenoids, 21 carbonyl compounds, 17 alcohols (from which 2 aromatics), 10 C13 norisoprenoids and 5 acids were identified. The results showed that, for both grape varieties, the levels and number of volatiles in skin were considerably higher than those observed in pulp. According to the data obtained by principal component analysis (PCA), the establishment of the global volatile signature of grape and the relationship between different part of grapes—pulp and skin, may be an useful tool to winemaker decision to define the vinification procedures that improves the organoleptic characteristics of the corresponding wines and consequently contributed to an economic valorization and consumer acceptance.

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)