Email updates

Keep up to date with the latest news and content from Journal of Cheminformatics and Chemistry Central.

This article is part of the supplement: 7th German Conference on Chemoinformatics: 25 CIC-Workshop

Open Access Open Badges Poster presentation

Tabu search based global optimization algorithms for problems in computational chemistry

Christoph Grebner*, Johannes Becker, Daniel Weber and Bernd Engels

  • * Corresponding author: Christoph Grebner

Author Affiliations

Institute of Physical and Theoretical Chemistry, University of Wuerzburg, Emil Fischer Strasse 42, Wuerzburg, 97074, Germany

For all author emails, please log on.

Journal of Cheminformatics 2012, 4(Suppl 1):P10  doi:10.1186/1758-2946-4-S1-P10

The electronic version of this article is the complete one and can be found online at:

Published:1 May 2012

© 2012 Grebner et al; licensee BioMed Central Ltd.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Poster presentation

Efficient searches for global minima of highly dimensional functions with numerous local minima are central for the solution of many problems in computational chemistry. Well known examples are the identification of the most stable conformer of molecules possessing a high number of freely rotatable bonds [1] or the equilibration phase for QM/MM computations. Mathematically, both represent global optimization problems in which the potential energy function of the molecule is the objective function while the coordinates used for representing the structural arrangement of the system are the variables.

Based on an analysis of well-known metaheuristic algorithms, several new global optimization algorithms based on Tabu Search (TS) were developed in our group [2,3], which are using a steepest descent – modest ascent strategy. In a first application the Gradient Only Tabu Search (GOTS) was shown to be applicable to conformational search problems [4].

Further test calculations showed its high efficiency in comparison to other global search algorithms like Molecular Dynamics, Simulated Annealing or Monte Carlo Minimization (MCM). The tests also revealed that the efficiency of GOTS can be enhanced dramatically by combining GOTS (searches the nearest neighbourhood highly efficient) with short MCM simulations (samples the phase space more widely) [5]. The new algorithm is implemented into a program for conformational search, providing several different force fields and sampling algorithms.

The investigations also pointed out that a key point is the algorithm for the modest ascent strategy. For providing a smoother scan of the potential energy surface as well as a more accurate description of the minimum energy path between two found minima, the Dimer-Method for transition state search was implemented into GOTS-MCM. First tests show that it is much more efficient than previous versions of GOTS. The new algorithm is applied to solvation of biomolecules to provide global optimized solvent shells [6].

In future, the GOTS algorithm will also be used for a proper prediction of reaction pathways by global optimized minimum energy paths and molecular modelling or docking of potential drug molecules to enzymes.


  1. Schlund S, Schmuck C, Engels B: .

    Chem Eur J 2007, 13:6644-6653. PubMed Abstract | Publisher Full Text OpenURL

  2. Stepanenko S, Engels B: .

    J Comp Chem 2007, 28:601-611. Publisher Full Text OpenURL

  3. Stepanenko S, Engels B: .

    J Comp Chem 2008, 29:768-780. Publisher Full Text OpenURL

  4. Stepanenko S, Engels B: .

    J Phys Chem A 2009, 113:11699-11705. PubMed Abstract | Publisher Full Text OpenURL

  5. Grebner C, Becker J, Stepanenko S, Engels B: .

    J Comp Chem 2011, 32:2245-2253. Publisher Full Text OpenURL

  6. Manuscript in preparation