We describe in this article our solution to the global minimum problem which uses the simulated annealing algorithm of Kirkpatrick. This method is a Metropolis (e-AElkT) Monte Carlo sampling of conformation space with simultaneous constraint of the search by lowering the temperature T so that the se
An ant algorithm for the conformational analysis of flexible molecules
β Scribed by Frits Daeyaert; Marc De Jonge; Luc Koymans; Maarten Vinkers
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 592 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Originally, the ant system was developed for optimization in discrete search spaces such as the traveling salesman problem. We detail our adaptation of the algorithm to optimization in the continuous search space of conformational analysis. The parameters of the algorithm were tuned using a simple test molecule, undecane, and a drug molecule, imatinib. The algorithm is further tested on four more drug or drugβlike molecules, on vitamin A and on alanine tetrapeptide. Β© 2007 Wiley Periodicals, Inc. J Comput Chem, 2007
π SIMILAR VOLUMES
## Abstract The efficient filtering of unfeasible conformations would considerably benefit the exploration of the conformational space when searching for minimum energy structures or during molecular simulation. The most important conditions for filtering are the maintenance of molecular chain inte