Research Article  Open Access
Yi Fu, Xiaojun Wu, Zhiguo Chen, Jun Sun, Ji Zhao, Wenbo Xu, "A New Approach for Flexible Molecular Docking Based on Swarm Intelligence", Mathematical Problems in Engineering, vol. 2015, Article ID 540186, 10 pages, 2015. https://doi.org/10.1155/2015/540186
A New Approach for Flexible Molecular Docking Based on Swarm Intelligence
Abstract
Molecular docking methods play an important role in the field of computeraided drug design. In the work, on the basis of the molecular docking program AutoDock, we present QLDock as a tool for flexible molecular docking. For the energy evaluation, the algorithm uses the binding free energy function that is provided by the AutoDock 4.2 tool. The new search algorithm combines the features of a quantumbehaved particle swarm optimization (QPSO) algorithm and local search method of Solis and Wets for solving the highly flexible proteinligand docking problem. We compute the interaction of 23 proteinligand complexes and compare the results with those of the QDock and AutoDock programs. The experimental results show that our approach leads to substantially lower docking energy and higher docking precision in comparison to Lamarckian genetic algorithm and QPSO algorithm alone. QPSOls algorithm was able to identify the correct binding mode of 74% of the complexes. In comparison, the accuracy of QPSO and LGA is 52% and 61%, respectively. This difference in performance rises with increasing complexity of the ligand. Thus, the novel algorithm QPSOls may be used to dock ligand with many rotatable bonds with high accuracy.
1. Introduction
Computeraided tools have wide applications in various fields, such as biotechnology engineering, medical engineering, mathematical modeling, and electronic information [1–4]. In the drug design field, molecular docking is a useful tool in drug discovery and rational drug design. New drugs can be designed efficiently by using computeraided docking algorithm simulations to find highly affine components that bind well to the targeted protein [5, 6]. By doing so, the biochemical reaction that the target molecule catalyzes can be altered or prevented. In the past, drug discovery process was very expensive and time consuming by in vitro experiments. Now, structurebased in silico approach allows for a faster and cheaper identification of promising drug candidates by the virtual screening of compound databases [7].
Molecular docking has been developed with primarily two parts varying: scoring function and searching method [8, 9]. Docking methods typically use an energybased scoring function to identify the energetically most favorable ligand conformation when bound to the target. The general hypothesis is that lower energy scores represent better proteinligand bindings compared to higher energy values. Therefore, molecular docking can be viewed as a complex combinatorial optimization problem. The aim of combinatorial optimization is to find the ligandbinding mode with the lowest energy [10].
During the last decade, many different tools have been used for the docking problem, such as DOCK [11], GOLD [12], FlexX [13], and AutoDock [14]. Among these programs, AutoDock is a wellknown example of flexible docking technique. Simulated annealing [15] was originally used within AutoDock. Later, a genetic algorithm (GA) [14] and a Lamarckian genetic algorithm (LGA) [16], which incorporates a local search, have been added. Recently, also particle swarm optimization (PSO) [17–20] and ant colony optimization (ACO) [21] have been proposed as search methods in the AutoDock program. Although there exist many different algorithms and programs, the problem is far from being solved [22, 23]. None as of now can be viewed as offering a robust and accurate solution to the docking problem, even in the context of a rigid protein receptor. In general, the complexity of the task rises with increasing flexibility of the molecules. For flexible docking, the number of rotatable bonds of the side chains increases the dimension of the search space excessively. And if parts of the receptor are also considered to be flexible, the number of rotatable bonds of the system will be the sum of the rotatable bonds of ligand and receptor region; this situation should become more complicated.
In this study, we propose a novel search method called QPSOls for solving highly flexible docking problem, which is a hybrid of quantumbehaved particle swarm optimization (QPSO) and a local search method. In 2004, inspired by quantum mechanics and trajectory analysis of PSO [24], Sun et al. [25] used a strategy based on a quantum delta potential well model to sample around the previous best points and later introduced the mean best position into the algorithm and proposed a new version of PSO, quantumbehaved particle swarm optimization. QPSO is a kind of probabilistic algorithm [26]; it needs no velocity vectors for particles and has fewer parameters to adjust. It has been proved that this iterative equation leads QPSO to be globally convergent [27]. It has been shown to successfully solve a wide range of continuous optimization problems. For example, it has been used to tackle the problems of multiobjective optimization [28], neural network training [29], bioinformatics [30], and so on. In addition to the applications, many efficient strategies have been proposed to improve the performance of QPSO [31, 32]. In the study, to improve search performance, an efficient variant of the Solis and Wets local search technique [33] is incorporated into QPSO algorithm such that both techniques cooperate fully with each other. Simulation results reveal that QPSOls has a better convergence and a lower docked energy than QPSO algorithm alone. The environment and scoring function that are used by the algorithm are provided by AutoDock version 4.2.
The remaining part of the paper is arranged as follows. First in Section 2 we describe the algorithms and scoring function employed by the program for the docking problem. Next in Section 3 we describe input data preparation and docking protocols. The docking experimental results are discussed in Section 4. Finally, conclusions are given in Section 5.
2. Algorithm and Scoring Function
2.1. QuantumBehaved Particle Swarm Optimization (QPSO) Scheme
Quantumbehaved particle swarm optimization (QPSO) was motivated by concepts from quantum mechanics and particle swarm optimization (PSO); it is a probabilistic optimization algorithm. In QPSO, the state of a particle is depicted by wavefunction instead of and . The dynamic behavior of the particle is widely divergent from that of the particle in traditional PSO systems in that the exact values of and cannot be determined simultaneously. We can only learn the probability of the particle’s appearing in position from probability density function , the form of which depends on the potential field the particle lies in. And then the probability distribution function of the particle’s position can be calculated through the probability density function. By employing the Monte Carlo method, the particle’s position is updated according to the following equation:
In [25], parameter is evaluated bywhere parameter is called the contractionexpansion coefficient, which can be tuned to control the convergence speed of the algorithms. Then we get the position update equation as
Parameter is the only parameter in QPSO algorithm. The control method of is vital to convergence rate and performance of the algorithm. Therefore, in the later work [34], Sun et al. proposed a mainstream thought point to evaluate parameter , the creativity of a particle. The mainstream thought point or mean best position (mbest) is defined as the center of gravity gbest position of the particle swarm. That is,where is the population size and is the gbest position of particle . The value of is given by
Hence, the particle’s position is updated according to the following equation:
This equation is iterative equation of position in quantumbehaved particle swarm optimization (QPSO) algorithm.
The procedure for implementing the QPSO is given by Algorithm 1.

2.2. Local Search
The local search method of Solis and Wets was employed in this study. The method of Solis and Wets is a stochastic heuristic for continuous parameter spaces, which introduces a probabilistic element. Its primal purpose is the local optimization of functions that do not provide gradient information. Basically, the local optimization starts by exploring a random direction in search space and generally follows this direction with random movements as long as the objective function keeps improving. Continued improvements lead to an expansion of the random search steps, whereas continued failing narrows the search. AutoDock adopts a LGA which is a hybrid of GA and a variant of Solis and Wets local search, and the algorithm is illustrated in detail in [19, 33].
2.3. Hybrid Algorithm of QLDock
The landscape of energy function contains many local minima for flexible docking, so the performance of using only individual global search or local search may be not satisfactory. By analogy to combining GA with LS, we combined QPSO with LS and applied a hybrid algorithm to solve high flexible docking problem by proper design to enhance advantages of both algorithms as well as reducing their disadvantages to solve specific optimization problem.
In the hybrid search, QPSO can globally explore promising regions with low energy; the local search modifies the position parameters of a particle without referring to other particles and also maintains the diversity among particles. The local search may be applied to the particle according to a predefined probability. Hence, the algorithm QPSOls is beneficial to maintain diversity of particles and in turn prevent premature convergence. The global search method of QPSO and the Solis and Wets local search technique can efficiently compensate with each other in the new QPSOls hybrid algorithm. Simulation results show also that QPSO with local search is more efficient than QPSO without local search. A general structure of the QPSOls hybrid is as shown in Algorithm 2.

2.4. Scoring Function
Search algorithms are able to quickly generate large number of possible conformations. The purpose of a scoring function is to compare the “quality" of these possible solutions and then select best binding modes. The scoring functions in common use attempt to approximate the binding free energy for the ligand binding to the receptor; a low energy indicates stable system and thus a likely receptorligand binding interaction.
AutoDock 4.2 [35–37] adopts a semiempirical free energy scoring function to evaluate a docked conformation. The total docked energy is expressed as the sum of the intramolecular energy and the intermolecular energy of the ligand and protein. First, the intramolecular energetics are estimated for the transition from the unbound states to the conformation of the ligand and protein in the bound state. Then, the second step evaluates the intermolecular energetics of combining the ligand and protein in their bound conformation.
The force field includes six pairwise evaluations () and an estimate of the conformational entropy lost upon binding (): where refers to the “protein” and refers to the “ligand” in a proteinligand docking calculation.
Each of the pairwise energetic terms is defined by the following energy:
The first term is a typical LennardJones 126 dispersion repulsion interaction. The second term is a directional 1210 hydrogen bond potential. The third term is a screened Coulombic electrostatic potential. The final term is a desolvation potential based on the volume of atoms () that surround a given atom and shelter it from solvent.
3. Data Preparation and Parameter Setting
3.1. Data Preparation
The prepared protein and ligand structures were saved in the PDBQT file format with the AutoDock version 4.2. All the following procedures were performed using AutoDock Tools. First, the protein input files were obtained according to the AutoDock manual: remove water molecules and metal ions not belonging to the binding site first; repair residues with missing atoms; add hydrogen atoms, assign partial charges, and merge nonpolar hydrogen atoms; and assign solvent parameters. Then, the ligand input files also follow the AutoDock manual: extract the coordinates of ligand atoms from the PDB file; add hydrogen to all atoms and assign partial charges; and define rigid root and torsions of the ligand. The program AutoGrid was used to calculate energy grid maps. A default grid size of 60 × 60 × 60 points with a spacing of 0.375 Å was applied, which corresponds to a cube with an edge length of 22.5 Å.
3.2. Experiment Parameter Setting
The 23 proteinligand complexes that are used for the computational experiments are listed in Table 1. In AutoDock, the solution representation consists of a vector specifying the position and orientation of the ligand and the arrangement of its rotatable bonds. For describing the orientation of a ligand, a quaternion (defined by a unit vector and a rotation around that vector) is used. Hence, a solution of docking needs to optimize 7 + ntor parameters: 3 for the position, 4 for the orientation, and ntor for the number of rotatable bonds in the ligand.

The docking experiments were performed on the same computer. All methods use the same protein coordinate and start with exactly the same initial location, conformation, and orientation of the ligand. Each docking experiment has been repeated 30 times. The initial population was set to 50 individuals; maximum number of energy evaluations was 2.5 × 10^{5}; maximum number of generations was 27,000. The local search was based on the Solis and Wets local search. The probability of performing local search on individual was 0.06; the iterations of Solis and Wets local search were 300. The other parameters provided by the default setting were the same as in AutoDock.
4. Results
To compare the performance of the docking problem, we applied the same parameter settings for all algorithms. For the evaluation of each complex, we recorded the docking energy, root mean square deviation (RMSD), running time, and the total number of scoring function evaluations in all docking runs. We rewrote the AutoDock program using C++ under Linux. The docking tests run on an Intel Pentium dual core 3.0 GHz PC with 2 G memory. The OS is Red Hat Enterprise Linux.
4.1. Evaluation of Docking Energy
To investigate the efficiency of the hybrid algorithm of QPSOls, 30 independent docking experiments were performed for QLDock, QDock, and AutoDock. Optimization algorithms are guided only by energy function; their search ability can be evaluated in terms of docked energy. Table 2 shows the results of the best docking energy and RMSD value of 30 docking runs using three algorithms. We chose 23 proteinligand complexes to cover a wide range of ligands differing in their flexibility; the dimension of the search space ranges from 7 (2 rotatable bonds) to 27 (20 rotatable bonds). Since molecular docking simulation methods rely on the assumption that a lower binding energy of the predicted complex is closer to the native state, as can be seen in Table 2, QPSOls obtained the lowest energies for 19 out of 23 complexes. For highly flexible ligands with torsions >10, the energies obtained by QPSOls are much lower than those of LGA, except for the complex 2ifb with plm. The RMSD values obtained by QPSOls were also smaller than those of the LGAs, except for 1apu. For the complexes with less flexible ligands, the differences of both docked energy and RMSD between the three methods are not significant. The docking energy and RMSD obtained by QPSOls are considerably better than those returned by QPSO and LGA, for instance, especially for highly flexible docking. Also, it has been shown that the QPSOls performs very well compared to the common algorithm of QPSO.

In Figure 1, the docking energy of the best solution of 30 docking runs is shown for three algorithms. In the case of the structure 1aaq, the ligand psi has 20 rotatable bonds resulting in a dimension search space of 27 and represents a challenge for flexible docking. In QPSOls algorithm, the application of the local search strategy is advantageous resulting in a pose with binding energy = −17.14 kcal/mol and an RMSD value of 1.64 Å. In comparison, the value of QPSO’s binding energy = −10.63 kcal/mol and RMSD = 3.90 Å and the value of LGA’s binding energy = −8.82 kcal/mol and RMSD = 2.96 Å, respectively.
Moreover, QPSOls finds this ligand complex with lower binding energy after approximately 140,000 computing steps in comparison to 150,000 computing steps found by the LGA. It shows that QPSOls had better convergence performance than LGA, which also employs a local search strategy. The average execution time of QPSOls per independent run was 27.53 s, while that of LGA was 25.69 s. The execution time of QPSOls was slightly greater than that of LGA using the same number 250,000 of function evaluations.
For the complexes with less flexible ligands, the evolution of the lowest energy among the individuals through generations displays a similar behavior for three algorithms, and the algorithm converges very rapidly to lower energies. In most of the cases, the lowest energy is reached almost after 70000 computing steps and remains stable after that for the 1abf/fca complexes. Similar results are obtained also for other less flexible ligands.
For the complexes with more than 15 rotatable bonds, the algorithm QPSOls is able to find conformations with much lower binding energies than QPSO and LGA. In this situation, QPSO and LGA lose the diversity in the population quickly and converge in some local optima. Moreover, the results show that the good performance of QPSOls with respect to QPSO is due to the concept of local search during the optimization, which can help to escape local minima. Although the local search procedure of QPSOls algorithm is computationally more demanding, the chance to find the optimum is higher. Consequently, this algorithm should be well suited for docking of ligands with many rotatable bonds.
4.2. Comparison of Docking Accuracy
To assess the docking accuracy of three programs, the root mean square deviation (RMSD) value with respect to the reference structure was chosen as a measure for the quality of the prediction. RMSD can be calculated using the following formula: where is the total number of atoms in the molecule and is a distance between each pair of corresponding atoms. The RMSD value of 2 Å is used as a cutoff value. Poses closer to the experimentally determined structure (with RMSD lower than 2 Å) are considered sound.
Figure 2 presents the plots of the RMSD values derived by QLDock and two other docking programs versus corresponding proteinligand complexes. A prediction of a binding mode is considered successful if the RMSD is below 2 Å. As can be seen from Figure 2, the QPSOls algorithm of QLDOCK predicts the proteinligand complexes correctly in 74% of the cases, which is the highest percentage of all docking programs applied. The QPSO algorithm of QDOCK was successful in 52% of the cases and AutoDock in 61%. In 12 of 23 cases, QLDock provides also the lowest RMSD value of all docking programs investigated with an RMSD below 2.0 Å, as three programs employ the same docking function, which indicates the superior sampling efficiency of the QPSOls algorithm.
Comparing the performance of algorithm with respect to the flexibility of a ligand, we divided the investigated complexes into two classes depending on the number of rotatable bonds of the ligand: when the rotatable bond is more than five, ligand is regarded as highly flexible molecule. As listed in Table 1, QLDock predicts highly flexible ligands very well with an average RMSD value of 1.65 Å. The average RMSD values are 2.25 Å and 2.10 Å for QPSO and LGA docking programs, respectively. We can observe that better results are obtained for mean RMSD in the case of rotatable bond >10. On the contrary, this confirms again the applicability of the QPSOls algorithm for an efficient sampling in highdimensional search spaces.
In Figure 3(a)1aaq, we present results for the 1aaq/psi proteinligand complex which show that the QLDock method gives very useful insights into possible docking paths. The 3D visualization of the docking state as computed by QPSO and LGA for the 1aaq/psi suggests that the ligand could be undocked in suitable position; the aromatic ring of psi is misplaced as demonstrated in Figures 3(b)1aaq and 3(c)1aaq. Only QPSOls did find its suitable binding pose; its RMSD is 1.64 Å. In Figure 3 bottom fca was docked into the active site of 1abf by three algorithms, and the resultant binding poses were superposed with their binding poses in the Xray crystal structures of fca complexes. For instance, the three results are all docked into the 1hvr active site in an acceptable accuracy; the values of RMSD were 0.95 Å, 1.81 Å, and 0.78 Å for QPSOls, QPSO, and LGA, respectively. This demonstrates that the QPSOls results are much better than that of other docking programs in handling complex docking problems.
(a)
(b)
(c)
5. Conclusion
A QPSOls algorithm for the molecular docking problem was presented in this paper. We evaluated its performance by a series of experiments using 23 complexes. The proposed algorithm uses the energy evaluation function of the wellknown tool AutoDock 4.2. To ensure the preservation of diversities of the particles and prevent the convergence procedure from prematurity, a local search strategy has been implemented. Although the number of computing steps needed to reach convergence increases, the QPSOls algorithm clearly outperforms the QPSO algorithm and the default LGA in terms of docked energy, convergence performance, robustness, and accuracy of the highdimensional molecular docking problem. As demonstrated above, these results indicate also that successful identification of binding modes might be further improved by combining the results from multiple programs, and the QPSO based program seems to be excellent approach and alternative to solve the flexible docking problem in molecular docking.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The authors gratefully acknowledge financial support from “Qing Lan Project” of Jiangsu province and National Natural Science Foundation of China (60774079 and 61300149).
References
 C. Toma, “Waveletscomputational aspects of Sterian realistic approach to uncertainty principle in high energy physics: a transient approach,” Advances in High Energy Physics, vol. 2013, Article ID 735452, 6 pages, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 E. G. Bakhoum, “Sparameters model for data communications over 3phase transmission lines,” IEEE Transactions on Smart Grid, vol. 2, no. 4, pp. 615–623, 2011. View at: Publisher Site  Google Scholar
 L. Li, H. Peng, J. Kurths, Y. Yang, and H. J. Schellnhuber, “Chaosorder transition in foraging behavior of ants,” Proceedings of the National Academy of Sciences of the United States of America, vol. 111, no. 23, pp. 8392–8397, 2014. View at: Publisher Site  Google Scholar
 M. Li, “Approximating ideal filters by systems of fractional order,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 365054, 6 pages, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 I. Halperin, B. Ma, H. Wolfson, and R. Nussinov, “Principles of docking: an overview of search algorithms and a guide to scoring functions,” Proteins: Structure, Function and Genetics, vol. 47, no. 4, pp. 409–443, 2002. View at: Publisher Site  Google Scholar
 R. D. Taylor, P. J. Jewsbury, and J. W. Essex, “A review of proteinsmall molecule docking methods,” Journal of ComputerAided Molecular Design, vol. 16, no. 3, pp. 151–166, 2002. View at: Publisher Site  Google Scholar
 R. Thomsen and M. H. Christensen, “MolDock: a new technique for highaccuracy molecular docking,” Journal of Medicinal Chemistry, vol. 49, no. 11, pp. 3315–3321, 2006. View at: Publisher Site  Google Scholar
 H. Gohlke, M. Hendlich, and G. Klebe, “Knowledgebased scoring function to predict proteinligand interactions,” Journal of Molecular Biology, vol. 295, no. 2, pp. 337–356, 2000. View at: Publisher Site  Google Scholar
 E. Perola, K. Xu, T. M. Kollmeyer, S. H. Kaufmann, F. G. Prendergast, and Y. P. Pang, “Successful virtual screening of a chemical database for farnesyltransferase inhibitor leads,” Journal of Medicinal Chemistry, vol. 43, no. 3, pp. 401–408, 2000. View at: Publisher Site  Google Scholar
 L. Guo, Z. Yan, X. Zheng, L. Hu, Y. Yang, and J. A. Wang, “A comparison of various optimization algorithms of protein–ligand docking programs by fitness accuracy,” Journal of Molecular Modeling, vol. 20, no. 7, pp. 2251–2261, 2014. View at: Publisher Site  Google Scholar
 S. Makino and I. D. Kuntz, “Automated flexible ligand docking method and its application for database search,” Journal of Computational Chemistry, vol. 18, no. 14, pp. 1812–1825, 1997. View at: Publisher Site  Google Scholar
 G. Jones, P. Willett, R. C. Glen, A. R. Leach, and R. Taylor, “Development and validation of a genetic algorithm for flexible docking,” Journal of Molecular Biology, vol. 267, no. 3, pp. 727–748, 1997. View at: Publisher Site  Google Scholar
 M. Rarey, B. Kramer, T. Lengauer, and G. Klebe, “A fast flexible docking method using an incremental construction algorithm,” Journal of Molecular Biology, vol. 261, no. 3, pp. 470–489, 1996. View at: Publisher Site  Google Scholar
 G. M. Morris, D. S. Goodsell, R. S. Halliday et al., “Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function,” Journal of Computational Chemistry, vol. 19, no. 14, pp. 1639–1662, 1998. View at: Publisher Site  Google Scholar
 D. S. Goodsell and A. J. Olson, “Automated docking of substrates to proteins by simulated annealing,” Proteins: Structure, Function and Genetics, vol. 8, no. 3, pp. 195–202, 1990. View at: Publisher Site  Google Scholar
 G. M. Morris, R. Huey, W. Lindstrom et al., “AutoDock4 and AutoDockTools4: automated docking with selective receptor flexibility,” Journal of Computational Chemistry, vol. 30, pp. 2785–2791, 2009. View at: Publisher Site  Google Scholar
 S. Janson and D. Merkle, “A new multiobjective particle swarm optimization algorithm using clustering applied to automated docking,” in Hybrid Metaheuristics, vol. 3636 of Lecture Notes in Computer Science, pp. 128–141, 2005. View at: Publisher Site  Google Scholar
 Y. Liu, L. Zhao, W. Li, D. Zhao, M. Song, and Y. Yang, “FIPSDock: a new molecular docking technique driven by fully informed swarm optimization algorithm,” Journal of Computational Chemistry, vol. 34, no. 1, pp. 67–75, 2013. View at: Publisher Site  Google Scholar
 H.M. Chen, B.F. Liu, H.L. Huang, S.F. Hwang, and S.Y. Ho, “SODOCK: swarm optimization for highly flexible protein—ligand docking,” Journal of Computational Chemistry, vol. 28, no. 2, pp. 612–623, 2007. View at: Publisher Site  Google Scholar
 V. Namasivayam and R. Günther, “PSO@AUTODOCK: a fast flexible molecular docking program based on swarm intelligence,” Chemical Biology and Drug Design, vol. 70, no. 6, pp. 475–484, 2007. View at: Publisher Site  Google Scholar
 O. Korb, T. Stiitzle, and T. E. Exner, “PLANTS: application of ant colony optimization to structurebased drug design,” in Ant Colony Optimization and Swarm Intelligence: Proceedings of the 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4–7, 2006, vol. 4150 of Lecture Notes in Computer Science, pp. 247–258, Springer, Berlin, Germany, 2006. View at: Publisher Site  Google Scholar
 J.L. Chen, C.W. Tsai, M.C. Chiang, and C.S. Yang, “A high performance cloudbased proteinligand docking prediction algorithm,” BioMed Research International, vol. 2013, Article ID 909717, 8 pages, 2013. View at: Publisher Site  Google Scholar
 A. N. Lima, E. A. Philot, D. Perahia, A. S. K. Braz, and L. P. B. Scott, “GANM: a proteinligand docking approach based on genetic algorithm and normal modes,” Applied Mathematics and Computation, vol. 219, no. 2, pp. 511–520, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 M. Clerc and J. Kennedy, “The particle swarmexplosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at: Publisher Site  Google Scholar
 J. Sun, B. Feng, and W. Xu, “Particle swarm optimization with particles having quantum behavior,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 1, pp. 325–331, June 2004. View at: Publisher Site  Google Scholar
 J. Kennedy, “Some issues and practices for particle swarms,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '07), pp. 162–169, Honolulu, Hawaii, USA, April 2007. View at: Publisher Site  Google Scholar
 J. Sun, X. J. Wu, W. Fang, Y. R. Ding, H. X. Long, and W. B. Xu, “Multiple sequence alignment using the hidden Markov model trained by an improved quantumbehaved particle swarm optimization,” Information Sciences, vol. 182, pp. 93–114, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 S. N. Omkar, R. Khandelwal, T. V. S. Ananth, G. N. Naik, and S. Gopalakrishnan, “Quantum behaved Particle Swarm Optimization (QPSO) for multiobjective design optimization of composite structures,” Expert Systems with Applications, vol. 36, no. 8, pp. 11312–11322, 2009. View at: Publisher Site  Google Scholar
 S. Y. Li, R. G. Wang, W. W. Hu, and J. Q. Sun, “A new QPSO based BP neural network for face detection,” in Fuzzy Information and Engineering, B.Y. Cao, Ed., vol. 40 of Advances in Soft Computing, pp. 355–363, Springer, Berlin, Germany, 2007. View at: Publisher Site  Google Scholar
 Y. Cai, J. Sun, J. Wang et al., “Optimizing the codon usage of synthetic gene with QPSO algorithm,” Journal of Theoretical Biology, vol. 254, no. 1, pp. 123–127, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 Z. Huang, Y. Wang, C. Yang, and C. Wu, “A new improved quantumbehaved particle swarm optimization model,” in Proceedings of the 5th IEEE Conference on Industrial Electronics and Applications (ICIEA '09), pp. 1560–1564, May 2009. View at: Publisher Site  Google Scholar
 M. Pant, R. Thangaraj, and V. P. SinghSobol, “Sobal mutated quantum particle swarm optimization,” International Journal of Recent Trends in Engineering, vol. 1, no. 1, pp. 95–99, 2009. View at: Google Scholar
 F. J. Solis and R. J.B. Wets, “Minimization by random search techniques,” Mathematics of Operations Research, vol. 6, no. 1, pp. 19–30, 1981. View at: Publisher Site  Google Scholar  MathSciNet
 J. Sun, B. Feng, and W. Xu, “A global search strategy of quantumbehaved particle swarm optimization,” in Proceedings of the IEEE Conference on Cybernetics and Intelligent Systems, vol. 1, pp. 111–116, December 2004. View at: Publisher Site  Google Scholar
 G. M. Morris, R. Huey, W. Lindstrom et al., “AutoDock4 and AutoDockTools4: automated docking with selective receptor flexibility,” Journal of Computational Chemistry, vol. 30, no. 16, pp. 2785–2791, 2009. View at: Publisher Site  Google Scholar
 S. Cosconati, S. Forli, A. L. Perryman, R. Harris, D. S. Goodsell, and A. J. Olson, “Virtual screening with AutoDock: theory and practice,” Expert Opinion on Drug Discovery, vol. 5, no. 6, pp. 597–607, 2010. View at: Publisher Site  Google Scholar
 S. Forli and A. J. Olson, “A force field with discrete displaceable waters and desolvation entropy for hydrated ligand docking,” Journal of Medicinal Chemistry, vol. 55, no. 2, pp. 623–638, 2012. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2015 Yi Fu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.