Adaptive global optimization with local search
Adaptive global optimization with local search
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
In silico protein-ligand docking is a basic problem in pharmaceuticsand bio-informatics research. One of the very few protein-ligand docking software with available source is the Autodock 3.05 of the ScrippsResearch Institute. Autodock 3.05 uses a Lamarckian genetic algorithmfor global optimization with a Solis-Wets local search strategy. In thiswork we evaluate the convergence speed and the deviation properties ofthe solution produced by Autodock with diverse parameter settings. Weconclude that the docking energies found by the genetic algorithm haveuncomfortably large deviations. We also suggest a method for considerablydecreasing the deviation while the number of evaluations will notbe increased.