{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:27:16Z","timestamp":1725992836831},"reference-count":24,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780128114322"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1016\/b978-0-12-809633-8.20329-4","type":"book-chapter","created":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T19:01:17Z","timestamp":1521140477000},"page":"321-327","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Methods for Global Optimization and Problem Solving"],"prefix":"10.1016","author":[{"given":"Giovanni","family":"Stracquadanio","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","article-title":"Simulated annealing","author":"Aarts","year":"2005","journal-title":"Search Methodologies"},{"year":"1997","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","key":"10.1016\/B978-0-12-809633-8.20329-4_bib2"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib3","series-title":"Simulated Annealing","article-title":"Improving the neighborhood selection strategy in simulated annealing using the optimal stopping problem","author":"Alizamir","year":"2008"},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20329-4_bib4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10589-009-9266-1","article-title":"Globalization strategies for mesh adaptive direct search","volume":"46","author":"Audet","year":"2010","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"10.1016\/B978-0-12-809633-8.20329-4_bib5","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(99)00321-5","article-title":"New stopping criterion for genetic algorithms","volume":"126","author":"Aytug","year":"2000","journal-title":"European Journal of Operational Research"},{"volume":"vol. 1","year":"2000","author":"B\u00e4ck","key":"10.1016\/B978-0-12-809633-8.20329-4_bib6"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib7","series-title":"Introduction to Modern Statistical Mechanics","first-page":"288","article-title":"Introduction to modern statistical mechanics","author":"Chandler","year":"1987"},{"volume":"vol. 5","year":"2007","author":"Coello","key":"10.1016\/B978-0-12-809633-8.20329-4_bib8"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib9","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N., 2009. Introduction to derivative-free optimization. MPS-SIAM Book Series on Optimization, SIAM, Philadelphia, PA. doi:10.1137\/1.9780898718768.","DOI":"10.1137\/1.9780898718768"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib10","doi-asserted-by":"crossref","unstructured":"Crosson, E., Harrow, A.W., 2016. Simulated quantum annealing can be exponentially faster than classical simulated annealing. In: IEEE Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 714\u2013723.","DOI":"10.1109\/FOCS.2016.81"},{"year":"2008","series-title":"Encyclopedia of Optimization","author":"Floudas","key":"10.1016\/B978-0-12-809633-8.20329-4_bib11"},{"year":"1989","series-title":"Genetic algorithms in search, optimization, and machine learning","author":"Goldberg","key":"10.1016\/B978-0-12-809633-8.20329-4_bib12"},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20329-4_bib13","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1103\/PhysRevE.59.938","article-title":"Scaling behavior of stochastic minimization algorithms in a perfect funnel landscape","volume":"59","author":"Hamacher","year":"1999","journal-title":"Physical Review E"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib14","unstructured":"Hansen, N., Ostermeier, A., Gawelczyk, A., 1995. On the adaptation of arbitrary normal mutation distributions in evolution strategies: The generating set adaptation. In: ICGA, pp. 57\u201364."},{"year":"1975","series-title":"Adaptation in Natural and Artificial Systems. An Introductory Analysis With Application to Biology, Control, and Artificial Intelligence","author":"Holland","key":"10.1016\/B978-0-12-809633-8.20329-4_bib15"},{"year":"2013","series-title":"Handbook of Global Optimization","author":"Horst","key":"10.1016\/B978-0-12-809633-8.20329-4_bib16"},{"issue":"8","key":"10.1016\/B978-0-12-809633-8.20329-4_bib17","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/0895-7177(89)90202-1","article-title":"Very fast simulated re-annealing","volume":"12","author":"Ingber","year":"1989","journal-title":"Mathematical and Computer Modelling"},{"issue":"4598","key":"10.1016\/B978-0-12-809633-8.20329-4_bib18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20329-4_bib19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1008623913524","article-title":"Simulated annealing and genetic algorithms for the facility layout problem: A survey","volume":"7","author":"Mavridou","year":"1997","journal-title":"Computational Optimization and Applications"},{"issue":"6","key":"10.1016\/B978-0-12-809633-8.20329-4_bib20","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"The Journal of Chemical Physics"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib21","doi-asserted-by":"crossref","first-page":"271369","DOI":"10.1017\/S0962492904000194","article-title":"Complete search in continuous global optimization and constraint satisfaction","volume":"13","author":"Neumaier","year":"2004","journal-title":"Acta Numerica"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib22","first-page":"405","article-title":"On stopping criteria for genetic algorithms","volume":"2004","author":"Safe","year":"2004","journal-title":"Advances in Artificial Intelligence-SBIA"},{"key":"10.1016\/B978-0-12-809633-8.20329-4_bib23","series-title":"Search Methodologies","first-page":"93","article-title":"Genetic algorithms","author":"Sastry","year":"2014"},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20329-4_bib24","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","article-title":"Evolutionary programming made faster","volume":"3","author":"Yao","year":"1999","journal-title":"IEEE Transactions on Evolutionary computation"}],"container-title":["Encyclopedia of Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338203294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338203294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T19:35:53Z","timestamp":1548099353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780128096338203294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9780128114322"],"references-count":24,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-809633-8.20329-4","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}