Application of uniform design and genetic algorithm in optimization of reversed-phase chromatographic separation

An optimization method based on uniform design in conjunction with genetic algorithm is described. According to the proposed method, the uniform design technique was applied to the design of starting experiments, which can reduce the number of experiments compared with traditional simultaneous methods, such as simplex. And genetic algorithm was used in optimization procedure, which can improve the rapidity of optimal procedure. The hierarchical chromatographic response function was modified to evaluate the separation equality of a chromatogram. An iterative procedure was adopted to search for the optimal condition to improve the accuracy of predicted retention and the quality of the chromatogram. The optimization procedure was tested in optimization of the chromatographic separation of 11 alkaloids in reversed-phase ion pair chromatography and satisfactory optimal result was obtained. (C) 2003 Elsevier B.V. All rights reserved.

value-based multiple software projects scheduling with genetic algorithm

Chinese Acad Sci, ISCAS Lab Internet Software Technologies

A Lower-Bound Result on the Power of a Genetic Algorithm

This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for the class of monotonic functions, the algorithm finds the optimal solution, and does so with an exponential convergence rate. The analysis pertains to the ideal behavior of the algorithm where the main task reduces to showing convergence of probability distributions over the search space of combinatorial structures to the optimal one. We take exponential convergence to be indicative of efficient solvability for the sample-bounded algorithm, although a sampling theory is needed to better relate the limit behavior to actual behavior. The paper concludes with a discussion of some immediate problems that lie ahead.

The use of a biased heuristic by a genetic algorithm applied to the design of multipoint connections in a local access network

This paper presents a genetic algorithm for finding a constrained minimum spanning tree. The problem is of relevance in the design of minimum cost communication networks, where there is a need to connect all the terminals at a user site to a terminal concentrator in a multipoint (tree) configuration, while ensuring that link capacity constraints are not violated. The approach used maintains a distinction between genotype and phenotype, which produces superior results to those found using a direct representation in a previous study.

Genetic Algorithm Search for Predictive Patterns in Multidimensional Time Series

Based on an algorithm for pattern matching in character strings, we implement a pattern matching machine that searches for occurrences of patterns in multidimensional time series. Before the search process takes place, time series are encoded in user-designed alphabets. The patterns, on the other hand, are formulated as regular expressions that are composed of letters from these alphabets and operators. Furthermore, we develop a genetic algorithm to breed patterns that maximize a user-defined fitness function. In an application to financial data, we show that patterns bred to predict high exchange rates volatility in training samples retain statistically significant predictive power in validation samples.