{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:35:51Z","timestamp":1776335751947,"version":"3.51.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T00:00:00Z","timestamp":1709078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10898-024-01373-5","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T02:02:10Z","timestamp":1709085730000},"page":"803-832","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A performance analysis of Basin hopping compared to established metaheuristics for global optimization"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5630-7173","authenticated-orcid":false,"given":"Marco","family":"Baioletti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1483-7998","authenticated-orcid":false,"given":"Valentino","family":"Santucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9571-0683","authenticated-orcid":false,"given":"Marco","family":"Tomassini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,28]]},"reference":[{"key":"1373_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-free and Blackbox Optimization. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68913-5"},{"key":"1373_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40137-4","volume-title":"Contemporary Evolution strategies","author":"T B\u00e4ck","year":"2013","unstructured":"B\u00e4ck, T., Foussette, C., Krause, P.: Contemporary Evolution strategies. Springer, Berlin, Heidelberg (2013)"},{"issue":"4","key":"1373_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"issue":"4598","key":"1373_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"1373_CR5","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968 . IEEE","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1373_CR6","volume-title":"Introduction to global optimization","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Introduction to global optimization. Ecole Polytechnique, France (2008)"},{"key":"1373_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972672","volume-title":"Global Optimization: Theory, Algorithms, and Applications","author":"M Locatelli","year":"2013","unstructured":"Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications. Society for Industrial and Applied Mathematics, Philadelphia, USA (2013)"},{"key":"1373_CR8","volume-title":"Algorithms for Optimization","author":"MJ Kochenderfer","year":"2019","unstructured":"Kochenderfer, M.J., Wheeler, T.A.: Algorithms for Optimization. MIT Press, Cambridge, Massachusetts (2019)"},{"issue":"1","key":"1373_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-017-18940-4","volume":"8","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev, Y.D., Kvasov, D.E., Mukhametzhanov, M.S.: On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Sci. Rep. 8(1), 1\u20139 (2018). https:\/\/doi.org\/10.1038\/s41598-017-18940-4","journal-title":"Sci. Rep."},{"issue":"5","key":"1373_CR10","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s00500-013-1104-9","volume":"18","author":"DT Pham","year":"2014","unstructured":"Pham, D.T., Castellani, M.: Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms. Soft. Comput. 18(5), 871\u2013903 (2014). https:\/\/doi.org\/10.1007\/s00500-013-1104-9","journal-title":"Soft. Comput."},{"issue":"28","key":"1373_CR11","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1021\/jp970984n","volume":"101","author":"DJ Wales","year":"1997","unstructured":"Wales, D.J., Doye, J.P.: Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J. Phys. Chem. A 101(28), 5111\u20135116 (1997). https:\/\/doi.org\/10.1021\/jp970984n","journal-title":"J. Phys. Chem. A"},{"issue":"5432","key":"1373_CR12","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1126\/science.285.5432.1368","volume":"285","author":"DJ Wales","year":"1999","unstructured":"Wales, D.J., Scheraga, H.A.: Global optimization of clusters, crystals, and biomolecules. Science 285(5432), 1368\u20131372 (1999). https:\/\/doi.org\/10.1126\/science.285.5432.1368","journal-title":"Science"},{"issue":"4","key":"1373_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/ijoc.1040.0084","volume":"16","author":"JP Doye","year":"2004","unstructured":"Doye, J.P., Leary, R.H., Locatelli, M., Schoen, F.: Global optimization of Morse clusters by potential energy transformations. INFORMS J. Comput. 16(4), 371\u2013379 (2004). https:\/\/doi.org\/10.1287\/ijoc.1040.0084","journal-title":"INFORMS J. Comput."},{"issue":"14","key":"1373_CR14","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1093\/bioinformatics\/btu156","volume":"30","author":"M Kucharik","year":"2014","unstructured":"Kucharik, M., Hofacker, I.L., Stadler, P.F., Qin, J.: Basin hopping graph: a computational framework to characterize RNA folding landscapes. Bioinformatics 30(14), 2009\u20132017 (2014). https:\/\/doi.org\/10.1093\/bioinformatics\/btu156","journal-title":"Bioinformatics"},{"key":"1373_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.3389\/fchem.2019.00519","volume":"7","author":"C Zhou","year":"2019","unstructured":"Zhou, C., Ieritano, C., Hopkins, W.S.: Augmenting basin-hopping with techniques from unsupervised machine learning: Applications in spectroscopy and ion mobility. Front. Chem. 7, 519 (2019). https:\/\/doi.org\/10.3389\/fchem.2019.00519","journal-title":"Front. Chem."},{"issue":"17","key":"1373_CR16","doi-asserted-by":"publisher","first-page":"3776","DOI":"10.1021\/acs.jpca.1c00903","volume":"125","author":"A Banerjee","year":"2021","unstructured":"Banerjee, A., Jasrasaria, D., Niblett, S.P., Wales, D.J.: Crystal structure prediction for benzene using basin-hopping global optimization. J. Phys. Chem. A 125(17), 3776\u20133784 (2021). https:\/\/doi.org\/10.1021\/acs.jpca.1c00903","journal-title":"J. Phys. Chem. A"},{"key":"1373_CR17","doi-asserted-by":"publisher","unstructured":"Baioletti, M., Milani, A., Santucci, V., Tomassini, M.: Comparing basin hopping with differential evolution and particle swarm optimization. In: International Conference on the Applications of Evolutionary Computation (Part of EvoStar), pp. 46\u201360 (2022). https:\/\/doi.org\/10.1007\/978-3-031-02462-7_4 . Springer","DOI":"10.1007\/978-3-031-02462-7_4"},{"key":"1373_CR18","unstructured":"Hansen, N., Finck, S., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions. PhD thesis, INRIA (2009)"},{"key":"1373_CR19","doi-asserted-by":"publisher","unstructured":"Doerr, C., Wang, H., Ye, F., Rijn, S., B\u00e4ck, T.: IOHprofiler: A benchmarking and profiling tool for iterative optimization heuristics. arXiv preprint arXiv:1810.05281 (2018) https:\/\/doi.org\/10.48550\/arXiv.1810.05281","DOI":"10.48550\/arXiv.1810.05281"},{"key":"1373_CR20","doi-asserted-by":"publisher","unstructured":"Baudis, P.: COCOpf: An algorithm portfolio framework. arXiv preprint arXiv:1405.3487 (2014) https:\/\/doi.org\/10.48550\/arXiv.1405.3487","DOI":"10.48550\/arXiv.1405.3487"},{"issue":"3","key":"1373_CR21","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10589-007-9026-z","volume":"38","author":"A Grosso","year":"2007","unstructured":"Grosso, A., Locatelli, M., Schoen, F.: An experimental analysis of a population based approach for global optimization. Comput. Optim. Appl. 38(3), 351\u2013370 (2007). https:\/\/doi.org\/10.1007\/s10589-007-9026-z","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1373_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10107-006-0006-3","volume":"110","author":"A Grosso","year":"2007","unstructured":"Grosso, A., Locatelli, M., Schoen, F.: A population-based approach for hard global optimization problems based on dissimilarity measures. Math. Program. 110(2), 373\u2013404 (2007). https:\/\/doi.org\/10.1007\/s10107-006-0006-3","journal-title":"Math. Program."},{"issue":"4","key":"1373_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1026500301312","volume":"18","author":"RH Leary","year":"2000","unstructured":"Leary, R.H.: Global optimization on funneling landscapes. J. Global Optim. 18(4), 367\u2013383 (2000). https:\/\/doi.org\/10.1023\/A:1026500301312","journal-title":"J. Global Optim."},{"issue":"1\u20133","key":"1373_CR24","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1\u20133), 503\u2013528 (1989). https:\/\/doi.org\/10.1007\/BF01589116","journal-title":"Math. Program."},{"issue":"4","key":"1373_CR25","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965). https:\/\/doi.org\/10.1093\/comjnl\/7.4.308","journal-title":"Comput. J."},{"issue":"2","key":"1373_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","volume":"7","author":"MJ Powell","year":"1964","unstructured":"Powell, M.J.: An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7(2), 155\u2013162 (1964). https:\/\/doi.org\/10.1093\/comjnl\/7.2.155","journal-title":"Comput. J."},{"key":"1373_CR27","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: Framework and applications. In: Handbook of Metaheuristics, pp. 129\u2013168. Springer, Boston, MA (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_5","DOI":"10.1007\/978-3-319-91086-4_5"},{"key":"1373_CR28","doi-asserted-by":"publisher","unstructured":"Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 312\u2013317 (1996). https:\/\/doi.org\/10.1109\/ICEC.1996.542381 . IEEE","DOI":"10.1109\/ICEC.1996.542381"},{"key":"1373_CR29","volume-title":"Nevergrad - A gradient-free optimization platform","author":"J Rapin","year":"2018","unstructured":"Rapin, J., Teytaud, O.: Nevergrad - A gradient-free optimization platform. GitHub, Califirnia (2018)"},{"key":"1373_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"...Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S.J., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, \u0130, Feng, Y., Moore, E.W., Vander Plas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., van Mulbregt, P.: SciPy 1.0 contributors: SciPy 10: fundamental algorithms for scientific computing in python. Nat. Methods 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat. Methods"},{"issue":"141","key":"1373_CR31","doi-asserted-by":"publisher","first-page":"395","DOI":"10.4064\/aa141-4-6","volume":"4","author":"H Faure","year":"2010","unstructured":"Faure, H., Pillichshammer, F., Pirsic, G., Schmid, W.C.: L2 discrepancy of generalized two-dimensional hammersley point sets scrambled with arbitrary permutations. Acta Arith 4(141), 395\u2013418 (2010). https:\/\/doi.org\/10.4064\/aa141-4-6","journal-title":"Acta Arith"},{"issue":"1","key":"1373_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997). https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1373_CR33","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2015.07.029","volume":"600","author":"A Alabert","year":"2015","unstructured":"Alabert, A., Berti, A., Caballero, R., Ferrante, M.: No-free-lunch theorems in the continuum. Theoret. Comput. Sci. 600, 98\u2013106 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.029","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1373_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut. Comput. 1(1), 3\u201318 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evolut. Comput."},{"key":"1373_CR35","doi-asserted-by":"publisher","unstructured":"Hollander, M., Wolfe, D.A., Chicken, E.: Nonparametric Statistical Methods vol. 751. John Wiley & Sons, Ltd, Hoboken, New Jersey, USA (2013). https:\/\/doi.org\/10.1002\/9781119196037","DOI":"10.1002\/9781119196037"},{"issue":"1","key":"1373_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3510426","volume":"2","author":"H Wang","year":"2022","unstructured":"Wang, H., Vermetten, D., Ye, F., Doerr, C., B\u00e4ck, T.: IOHanalyzer: detailed performance analyses for iterative optimization heuristics. ACM Trans. Evolut. Learn. Optim. 2(1), 1\u201329 (2022). https:\/\/doi.org\/10.1145\/3510426","journal-title":"ACM Trans. Evolut. Learn. Optim."},{"key":"1373_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5555\/1248547.1248548","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006). https:\/\/doi.org\/10.5555\/1248547.1248548","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1373_CR38","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10618-019-00619-1","volume":"33","author":"H Ismail Fawaz","year":"2019","unstructured":"Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., Muller, P.-A.: Deep learning for time series classification: a review. Data Min. Knowl. Disc. 33(4), 917\u2013963 (2019). https:\/\/doi.org\/10.1007\/s10618-019-00619-1","journal-title":"Data Min. Knowl. Disc."},{"key":"1373_CR39","unstructured":"Das, S., N.Suganthan, P.: Problem definitions and evaluation criteria for cec 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University, Nanyang Technological University, Kolkata, 341\u2013359 (2010)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01373-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01373-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01373-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T04:14:25Z","timestamp":1718424865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01373-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1373"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01373-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"assertion":[{"value":"4 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}