Stochastic Global Search on Molecular Potential-Energy Surfaces: A Narrative Survey and a Reported Numerical Illustration
Downloads
Abstract
Stochastic global search connects geometric exploration of potential-energy surfaces with the cost of evaluating electronic-structure models. This narrative survey relates population methods, basin hopping, minima hopping and surrogate-assisted search across clusters, molecular conformers, surface adsorbates and crystal structures. It distinguishes changes in the search policy from changes in the energy model and from evidence of computational savings. A surrogate-assisted hybrid search (SAHS) is discussed as an integration sketch, followed by the numerical illustration reported in the source manuscript for Lennard-Jones clusters and thirty synthetic potential functions. The retained summaries are not an independently reproduced electronic-structure experiment. The component table reports 3,600 evaluations for SAHS and 14,200 with its GP disabled, a count ratio of 3.94, while the corresponding accuracy entries differ. The reported timing of 295 seconds cannot be reconciled with a uniform 22-second parent calculation on sixteen cores without additional accounting. Negative differences from the stated energy reference, nonmonotone best-so-far traces and a reported p-value below the minimum for an exact two-sided thirty-pair test also require the original records. Recalculation gives a conventional Nemenyi critical difference of approximately 1.377 for six algorithms and thirty blocks, rather than the embedded annotation 1.318; the reported BH comparison does not reject. The survey therefore provides a methodological synthesis and a qualified interpretation of preserved numerical summaries, without establishing DFT acceleration, a globally certified molecular geometry or universal algorithm superiority.
Keywords
Potential-energy surfaces Metaheuristics Electronic structure Cluster minimization Surrogate-assisted optimization Lennard-Jones clusters Statistical testingReferences (34)
- [1] Podgornik, R. (2007). Energy landscapes: Applications to clusters, biomolecules and glasses (Cambridge molecular science). Journal of statistical physics, 126(2), 423–427. https://doi.org/10.1007/s10955-006-9264-y
- [2] Jensen, F. (2017). Introduction to computational chemistry. John Wiley & Sons. https://www.wiley.com/en-ie/shop/general-chemistry/introduction-to-computational-chemistry-3rd-edition-p-9781118825990
- [3] Henkelman, G., & Jónsson, H. (1999). A dimer method for finding saddle points on high dimensional potential surfaces using only first derivatives. The journal of chemical physics, 111(15), 7010–7022. https://doi.org/10.1063/1.480097
- [4] Storn, R., & Price, K. (1997). Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4), 341–359. https://doi.org/10.1023/A:1008202821328
- [5] Eberhart, R., & Kennedy, J. (1995). Particle swarm optimization. Proceedings of the IEEE international conference on neural networks (Vol. 4, pp. 1942–1948). IEEE. https://doi.org/10.1109/ICNN.1995.488968
- [6] Hansen, N., & Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary computation, 9(2), 159–195. https://doi.org/10.1162/106365601750190398
- [7] Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey wolf optimizer. Advances in engineering software, 69, 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007
- [8] Hartke, B. (1999). Global cluster geometry optimization by a phenotype algorithm with Niches: Location of elusive minima, and low-order scaling with cluster size. Journal of computational chemistry, 20(16), 1752–1759. https://doi.org/10.1002/(SICI)1096-987X(199912)20:16%3C1752::AID-JCC7%3E3.0.CO;2-0
- [9] Zhou, Y., Zhao, Z., & Cheng, D. (2020). Cluster structure prediction via revised particle-swarm optimization algorithm. Computer physics communications, 247, 106945. https://doi.org/10.1016/j.cpc.2019.106945
- [10] Wales, D. J., & Doye, J. P. K. (1997). Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. The journal of physical chemistry a, 101(28), 5111–5116. https://doi.org/10.1021/jp970984n
- [11] Wales, D. J., & Scheraga, H. A. (1999). Global optimization of clusters, crystals, and biomolecules. Science, 285(5432), 1368–1372. https://doi.org/10.1126/science.285.5432.1368
- [12] Goedecker, S. (2004). Minima hopping: An efficient search method for the global minimum of the potential energy surface of complex molecular systems. The journal of chemical physics, 120(21), 9911–9917. https://doi.org/10.1063/1.1724816
- [13] Jin, Y. (2011). Surrogate-assisted evolutionary computation: Recent advances and future challenges. Swarm and evolutionary computation, 1(2), 61–70. https://doi.org/10.1016/j.swevo.2011.05.001
- [14] Liu, X., Yang, Z., Liu, J., Xiong, J., Huang, J., Huang, S., & Fu, X. (2025). Surrogate-assisted global and distributed local collaborative optimization algorithm for expensive constrained optimization problems. Scientific reports, 15(1), 1728. https://doi.org/10.1038/s41598-025-85233-6
- [15] Liu, Y., Liu, J., Jin, Y., Li, F., & Zheng, T. (2023). A surrogate-assisted two-stage differential evolution for expensive constrained optimization. IEEE transactions on emerging topics in computational intelligence, 7(3), 715–730. https://doi.org/10.1109/TETCI.2023.3240221
- [16] Jung, H., Sauerland, L., Stocker, S., Reuter, K., & Margraf, J. T. (2023). Machine-learning driven global optimization of surface adsorbate geometries. NPJ computational materials, 9(1), 114. https://doi.org/10.1038/s41524-023-01065-w
- [17] Yang, Q., Li, Z. Y., Rodríguez-Kessler, P. L., & He, S. G. (2024). Accelerated global optimization of metal cluster structures via the deep neural network complemented with transfer learning and genetic algorithm. Chinese journal of chemical physics, 37(3), 321–329. https://doi.org/10.1063/1674-0068/cjcp2309083
- [18] Wang, Y., Lv, J., Zhu, L., & Ma, Y. (2012). CALYPSO: A method for crystal structure prediction. Computer physics communications, 183(10), 2063–2070. https://doi.org/10.1016/j.cpc.2012.05.008
- [19] Zhu, Z., Yang, Z., Liu, Z., Chen, L., & Cai, X. (2025). State information-driven surrogate-assisted differential evolution for computationally expensive constrained optimization problems. Complex & intelligent systems, 11(8), 359. https://doi.org/10.1007/s40747-025-01980-z
- [20] Rondina, G. G., & Da Silva, J. L. F. (2013). Revised basin-hopping Monte Carlo algorithm for structure optimization of clusters and nanoparticles. Journal of chemical information and modeling, 53(9), 2282–2298. https://doi.org/10.1021/ci400224z
- [21] Carmona, O., Rodríguez-Kessler, P. L., Salazar-Colores, S., & Muñoz-Castro, A. (2025). Revisiting and accelerating the Basin Hopping algorithm for Lennard-Jones clusters: Adaptive and parallel implementation in Python. https://doi.org/10.48550/arXiv.2510.25938
- [22] Behler, J., & Parrinello, M. (2007). Generalized neural-network representation of high-dimensional potential-energy surfaces. Physical review letters, 98(14), 146401. https://doi.org/10.1103/PhysRevLett.98.146401
- [23] Chmiela, S., Tkatchenko, A., Sauceda, H. E., Poltavsky, I., Schütt, K. T., & Müller, K. R. (2017). Machine learning of accurate energy-conserving molecular force fields. Science advances, 3(5), e1603015. https://doi.org/10.1126/sciadv.1603015
- [24] Jinnouchi, R., Karsai, F., & Kresse, G. (2019). On-the-fly machine learning force field generation: Application to melting points. https://doi.org/10.1103/PhysRevB.100.014105
- [25] Pracht, P., Bohle, F., & Grimme, S. (2020). Automated exploration of the low-energy chemical space with fast quantum chemical methods. Physical chemistry chemical physics, 22(14), 7169–7192. https://doi.org/10.1039/c9cp06869d
- [26] Oganov, A. R., & Glass, C. W. (2006). Crystal structure prediction using ab initio evolutionary techniques: Principles and applications. The journal of chemical physics, 124(24), 244704. https://doi.org/10.1063/1.2210932
- [27] Pickard, C. J., & Needs, R. J. (2011). Ab initio random structure searching. Journal of physics: condensed matter, 23(5), 53201. https://doi.org/10.1088/0953-8984/23/5/053201%0A%0A
- [28] Derrac, J., García, S., Molina, D., & Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and evolutionary computation, 1(1), 3–18. https://doi.org/10.1016/j.swevo.2011.02.002
- [29] Doye, J. P. K., Miller, M. A., & Wales, D. J. (1999). The double-funnel energy landscape of the 38-atom Lennard-Jones cluster. The journal of chemical physics, 110(14), 6896–6906. https://doi.org/10.1063/1.478595
- [30] Macbeth, G., Razumiejczyk, E., & Ledesma, R. D. (2011). Cliff’s delta calculator: A non-parametric effect size program for two groups of observations. Universitas psychologica, 10(2), 545–555. https://doi.org/10.11144/Javeriana.upsy10-2.cdcp
- [31] Hedges, L. V. (1981). Distribution theory for Glass’s estimator of effect size and related estimators. Journal of educational statistics, 6(2), 107–128. https://doi.org/10.3102/10769986006002107
- [32] Morris, M. D. (1991). Factorial sampling plans for preliminary computational experiments. Technometrics, 33(2), 161–174. https://doi.org/10.1080/00401706.1991.10484804
- [33] Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., … Contributors, S. (2020). SciPy 1.0: Fundamental algorithms for scientific computing in Python. Nature methods, 17(3), 261–272. https://doi.org/10.1038/s41592-019-0686-2
- [34] Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The journal of machine learning research, 7, 1–30. https://doi.org/10.5555/1248547.1248548
