Gates towards evolutionary large-scale optimization: A software-oriented approach to genetic algorithms—II. Toolbox description

doi:10.1016/0097-8485(94)85007-0

Computers & Chemistry

Volume 18, Issue 2, June 1994, Pages 137-156

https://doi.org/10.1016/0097-8485(94)85007-0 Get rights and content

Abstract

Starting from Part I, Part II of this paper globally describes the toolbox GATES, elucidating how concepts of genetic algorithm methodology can be implemented for application. The prototype for numerical parameter estimation is treated in most detail. Additionally, an auxiliary utility for configuration, based on explorative walks in the search space, is outlined.

References (38)

R.A. Caruana et al.
Representation and hidden bias: gray vs. binary coding for genetic algorithms
B.R. Fox et al.
Genetic operators for sequencing problems
F. James
A review of pseudorandom number generators
Comput. Phys. Comm.
(1990)
C.B. Lucasius et al.
Understanding and using genetic algorithms. Part 1: concepts, properties and context
Chemomet. Intell. Lab. Syst.
(1993)
C.B. Lucasius et al.
On k-medoid clustering of large data sets with the aid of a genetic algorithm: background, feasibility and comparison
Anal. Chim. Acta
(1993)
C.B. Lucasius et al.
GATES towards evolutionary large-scale optimization: a software-oriented approach to genetic algorithms—I. General perspective
Comput. Chem.
(1994)
G. Marsaglia et al.
Toward a universal random number generator
Stat. Prob. Lett.
(1990)
W.M. Spears et al.
An analysis of multipoint crossover
R. Wehrens et al.
HIPS, a hybrid self-adapting expert system for NMR spectrum interpretation using genetic algorithms
Anal. Chim. Acta
(1993)
J.N. Bhuyan et al.
Genetic algorithms for clustering with an ordered representation

L. Davis

Applying adaptive algorithms to epistatic domains

Ninth International Joint Conference on Artificial Intelligence

(1985)

L. Davis

(1991)

Jong K.A. De

An analysis of the Behavior of a Class of Genetic Adaptive Systems

(1975)

L.J. Eshelman et al.

Biases in the crossover landscape

E. Falkenauer

(1991)

E. Falkenauer

A genetic algorithm for grouping

D.E. Goldberg et al.

Alleles, loci, and the traveling salesman problem

D.E. Goldberg

(1989)

J.H. Holland

(1975)

Cited by (25)

A combination of numeric genetic algorithm and tabu search can be applied to molecular docking
2004, Computational Biology and Chemistry
Molecular interactions of α-cyclodextrin inclusion complexes using a genetic algorithm
2001, Journal of Molecular Structure: THEOCHEM
Molecular interactions of inclusion complexes of mono- or 1,4-disubstituted benzenes and α-cyclodextrin have been studied in this paper. Two types of energy terms were considered in the total interaction energies, non-bonded term and desolvation term, and minimized by a genetic algorithm (GA). Using the consistent force field (CFF91), the non-bonded energies between all pairs of atoms in different molecules were determined by a Coulomb potential term for electrostatic interactions and a Lennard-Jones potential for van der Waals interactions. The desolvation energy term was modeled by a simple constant term corresponding to a penalty when polar atoms are placed in the hydrophobic cavity. The total interaction energies for 15 inclusion complexes with experimental association constants (ln K) were optimized by the GA method. Linear regression analysis of the observed association constants against the total energies was performed. It was found that the interaction energies of these complexes obtained by the simple interaction energy model could be correlated with their experimental association constants, and also the desolvation term should be included.
Stability and geometry prediction for the inclusion complexes of mono- or 1,4-disubstituted benzenes and β-cyclodextrin using a genetic algorithm
2000, Chemical Physics Letters
Citation Excerpt :
The value of the interaction energy calculated by Eq. (1)was used as fitness to be minimized by the GA procedure. The roulette selection criterion [12], random pairing recombination, the simplest one-point cut crossover and the bit-level jump mutation were employed in the GA program. The raw fitness was rescaled in order to control the level of competition among members in the population.
The interaction energies of β-cyclodextrin (β-CD) and fourteen mono- and 1,4-disubstuted benzenes have been determined using consistent forcefield 91 (CFF91), and the geometries of the benzene derivatives were optimized by minimizing the energy using a genetic algorithm (GA). The Van der Waals and electrostatic interactions were considered as the binding forces. From the optimized energies, the linear relationships of the logarithm of the experimental association constants (ln K) with the total energy and with each energy factor were calculated. The calculation showed that there is an extremely good correlation between ln K and the total interaction energies. It indicated that the stability predicted by our method and the corresponding optimized model for the inclusion complexation are reliable. Furthermore, Van der Waals forces play a major role in the complex formation. The orientation of the guest molecules in the complexes obtained by GA is in good agreement with experimental studies.
The quality of optimisation by genetic algorithms
1999, Analytica Chimica Acta
The recently introduced quality criteria for optimisation, describing the coverage of the search and solution spaces as well as the reproducibility of both, are applied in combination with experimental design to fine-tune parameter settings and fitness function of a genetic algorithm for the structure optimisation of a heptapeptide. A series of influences of the investigated parameters are revealed by these criteria, while none of them seem significant from the fitness values of the last population alone. It is therefore suggested to apply these criteria, which are not based on the fitness value of the final population, when developing genetic algorithms. It is shown that they are easily adaptable to specific problems.
Using genetic algorithms for the construction of phylogenetic trees: Application to G-protein coupled receptor sequences
1999, BioSystems
Many different phylogenetic clustering techniques are used currently. One approach is to first determine the topology with a common clustering method and then calculate the branch lengths of the tree. If the resulting tree is not optimal exchanging tree branches can make some local changes in the tree topology. The whole process can be iterated until a satisfactory result has been obtained. The efficiency of this method fully depends on the initially generated tree. Although local changes are made, the optimal tree will never be found if the initial tree is poorly chosen. In this article, genetic algorithms are applied such that the optimal tree can be found even with a bad initial tree topology. This tree generating method is tested by comparing its results with the results of the FITCH program in the PHYLIP software package. Two simulated data sets and a real data set are used.
Learning classification rules from an ion chromatography database using a genetic based classifier system
1997, Analytica Chimica Acta
A classifier system based on genetic algorithm methodology was developed for the automatic extraction of production rules from a database of about 6000 ion chromatography (IC) method examples. This machine learning strategy generated heuristics that can assist in the choice for a detection method for a specified set of IC method and solute properties. It was shown that the final set of rules proposed detectors that agreed with the database for 76% of the cases. Application to a separate test set showed a prediction ability of 82%. The database, because of the characteristics of the included cases, did not allow for a significant improvement of these results. However, the results are of significance for the further development of knowledge systems, which assist in the design of IC methods. Furthermore, this dataset comprised a considerable challenge to the applied machine learning method.

View all citing articles on Scopus

View full text

Gates towards evolutionary large-scale optimization: A software-oriented approach to genetic algorithms—II. Toolbox description

Abstract

Comput. Phys. Comm.

Chemomet. Intell. Lab. Syst.

Anal. Chim. Acta

Comput. Chem.

Stat. Prob. Lett.