{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T01:13:25Z","timestamp":1680398005954},"reference-count":24,"publisher":"Walter de Gruyter GmbH","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We introduce a parallel scheme for simulated annealing, a widely used Markov chain Monte Carlo (MCMC) method for optimization.\nOur method is constructed and analyzed under the classical framework of MCMC.\nThe benchmark function for optimization is used for validation and verification of the parallel scheme.\nThe experimental results, along with the proof based on statistical theory, provide us with insights into the mechanics of the parallelization of simulated annealing for high parallel efficiency or scalability for large parallel computers.<\/jats:p>","DOI":"10.1515\/mcma-2019-2043","type":"journal-article","created":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T11:26:41Z","timestamp":1566041201000},"page":"227-237","source":"Crossref","is-referenced-by-count":0,"title":["Parallel MCMC methods for global optimization"],"prefix":"10.1515","volume":"25","author":[{"given":"Lihao","family":"Zhang","sequence":"first","affiliation":[{"name":"Applied Mathematics & Statistics , Stony Brook University , Stony Brook 11794-3600 , USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyang","family":"Ye","sequence":"additional","affiliation":[{"name":"Applied Mathematics & Statistics , Stony Brook University , Stony Brook 11794-3600 , USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuefan","family":"Deng","sequence":"additional","affiliation":[{"name":"Applied Mathematics & Statistics , Stony Brook University , Stony Brook 11794-3600 , USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2019,8,17]]},"reference":[{"key":"2023040102122321874_j_mcma-2019-2043_ref_001_w2aab3b7b4b1b6b1ab1b5b1Aa","unstructured":"E. H. L.  Aarts and P. J. M.  van Laarhoven,\nStatistical cooling: A general approach to combinatorial optimization problems,\nPhilips J. Res. 40 (1985), no. 4, 193\u2013226."},{"key":"2023040102122321874_j_mcma-2019-2043_ref_002_w2aab3b7b4b1b6b1ab1b5b2Aa","doi-asserted-by":"crossref","unstructured":"D.  Abramson,\nConstructing school timetables using simulated annealing: Sequential and parallel algorithms,\nManag. Sci. 37 (1991), no. 1, 98\u2013113.\n10.1287\/mnsc.37.1.98","DOI":"10.1287\/mnsc.37.1.98"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_003_w2aab3b7b4b1b6b1ab1b5b3Aa","unstructured":"K. D.  Boese,\nModels for Iterative Global Optimization,\nPhD thesis, University of California, Los Angeles, 1996."},{"key":"2023040102122321874_j_mcma-2019-2043_ref_004_w2aab3b7b4b1b6b1ab1b5b4Aa","doi-asserted-by":"crossref","unstructured":"Y.-L.  Chang, J.-P.  Fang, W.-Y.  Liang, L.  Chang, H.  Ren and K.-S.  Chen,\nA parallel simulated annealing approach to band selection for hyperspectral imagery,\n2008 IEEE International Geoscience and Remote Sensing Symposium\u2014IGARSS 2008,\nIEEE Press, Piscataway (2008), 10.1109\/IGARSS.2008.4779164.","DOI":"10.1109\/IGARSS.2008.4779164"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_005_w2aab3b7b4b1b6b1ab1b5b5Aa","doi-asserted-by":"crossref","unstructured":"D.-J.  Chen, C.-Y.  Lee, C.-H.  Park and P.  Mendes,\nParallelizing simulated annealing algorithms based on high-performance computer,\nJ. Global Optim. 39 (2007), no. 2, 261\u2013289.\n10.1007\/s10898-007-9138-0","DOI":"10.1007\/s10898-007-9138-0"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_006_w2aab3b7b4b1b6b1ab1b5b6Aa","doi-asserted-by":"crossref","unstructured":"H.  Chen, N. S.  Flann and D. W.  Watson,\nParallel genetic simulated annealing: A massively parallel simd algorithm,\nIEEE Trans. Parallel Distrib. Syst. 9 (1998), no. 2, 126\u2013136.\n10.1109\/71.663870","DOI":"10.1109\/71.663870"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_007_w2aab3b7b4b1b6b1ab1b5b7Aa","doi-asserted-by":"crossref","unstructured":"K.-W.  Chu, Y.  Deng and J.  Reinitz,\nParallel simulated annealing by mixing of states,\nJ. Comput. Phys. 148 (1999), no. 2, 646\u2013662.\n10.1006\/jcph.1998.6134","DOI":"10.1006\/jcph.1998.6134"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_008_w2aab3b7b4b1b6b1ab1b5b8Aa","doi-asserted-by":"crossref","unstructured":"A. M.  Ferreiro, J. A.  Garc\u00eda, J. G.  L\u00f3pez-Salas and C.  V\u00e1zquez,\nAn efficient implementation of parallel simulated annealing algorithm in GPUs,\nJ. Global Optim. 57 (2013), no. 3, 863\u2013890.\n10.1007\/s10898-012-9979-z","DOI":"10.1007\/s10898-012-9979-z"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_009_w2aab3b7b4b1b6b1ab1b5b9Aa","doi-asserted-by":"crossref","unstructured":"A. O.  Griewank,\nGeneralized descent for global optimization,\nJ. Optim. Theory Appl. 34 (1981), no. 1, 11\u201339.\n10.1007\/BF00933356","DOI":"10.1007\/BF00933356"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_010_w2aab3b7b4b1b6b1ab1b5c10Aa","doi-asserted-by":"crossref","unstructured":"B.  Hajek,\nCooling schedules for optimal annealing,\nMath. Oper. Res. 13 (1988), no. 2, 311\u2013329.\n10.1287\/moor.13.2.311","DOI":"10.1287\/moor.13.2.311"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_011_w2aab3b7b4b1b6b1ab1b5c11Aa","doi-asserted-by":"crossref","unstructured":"A.-R.  Hedar and M.  Fukushima,\nHybrid simulated annealing and direct search method for nonlinear unconstrained global optimization,\nOptim. Methods Softw. 17 (2002), no. 5, 891\u2013912.\n10.1080\/1055678021000030084","DOI":"10.1080\/1055678021000030084"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_012_w2aab3b7b4b1b6b1ab1b5c12Aa","unstructured":"M. D.  Huang,\nAn efficient general cooling schedule for simulated annealing,\nComputational Science and Its Applications\u2014ICCSA 2004,\nLecture Notes in Comput. Sci. 3045,\nSpringer, Berlin (1986), 381\u2013384."},{"key":"2023040102122321874_j_mcma-2019-2043_ref_013_w2aab3b7b4b1b6b1ab1b5c13Aa","doi-asserted-by":"crossref","unstructured":"D.  Janaki Ram, T. H.  Sreenivas and K.  Ganapathy Subramaniam,\nParallel simulated annealing algorithms,\nJ. Parallel Distrib. Comp. 37 (1996), no. 2, 207\u2013212.\n10.1006\/jpdc.1996.0121","DOI":"10.1006\/jpdc.1996.0121"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_014_w2aab3b7b4b1b6b1ab1b5c14Aa","doi-asserted-by":"crossref","unstructured":"S.  Kirkpatrick, C. D.  Gelatt, Jr. and M. P.  Vecchi,\nOptimization by simulated annealing,\nScience 220 (1983), no. 4598, 671\u2013680.\n10.1126\/science.220.4598.671","DOI":"10.1126\/science.220.4598.671"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_015_w2aab3b7b4b1b6b1ab1b5c15Aa","doi-asserted-by":"crossref","unstructured":"M.-Y.  Ku, M. H.  Hu and M.-J.  Wang,\nSimulated annealing based parallel genetic algorithm for facility layout problem,\nInt. J. Production Res. 49 (2011), no. 6, 1801\u20131812.\n10.1080\/00207541003645789","DOI":"10.1080\/00207541003645789"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_016_w2aab3b7b4b1b6b1ab1b5c16Aa","unstructured":"J. K.-C.  Lam,\nAn efficient simulated annealing schedule,\nPhD thesis, Yale University, 1989."},{"key":"2023040102122321874_j_mcma-2019-2043_ref_017_w2aab3b7b4b1b6b1ab1b5c17Aa","doi-asserted-by":"crossref","unstructured":"N.  Li, J.  Cha and Y.  Lu,\nA parallel simulated annealing algorithm based on functional feature tree modeling for 3d engineering layout design,\nAppl. Soft Comput. 10 (2010), no. 2, 592\u2013601.\n10.1016\/j.asoc.2009.08.033","DOI":"10.1016\/j.asoc.2009.08.033"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_018_w2aab3b7b4b1b6b1ab1b5c18Aa","unstructured":"Z.  Lou,\nA massively scalable parallel simulated annealing algorithm,\nPhD thesis, University of Chicago, 2016."},{"key":"2023040102122321874_j_mcma-2019-2043_ref_019_w2aab3b7b4b1b6b1ab1b5c19Aa","doi-asserted-by":"crossref","unstructured":"Z.  Lou and J.  Reinitz,\nParallel simulated annealing using an adaptive resampling interval,\nParallel Comput. 53 (2016), 23\u201331.\n10.1016\/j.parco.2016.02.001","DOI":"10.1016\/j.parco.2016.02.001"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_020_w2aab3b7b4b1b6b1ab1b5c20Aa","unstructured":"M.  Miki, T.  Hiroyasu, K.  Ono and T.  Fushimi,\nTemperature parallel simulated annealing with advanced adaptive neighborhood,\nIPSJ J. 44 (2003), no. 12, 3123\u20133130."},{"key":"2023040102122321874_j_mcma-2019-2043_ref_021_w2aab3b7b4b1b6b1ab1b5c21Aa","doi-asserted-by":"crossref","unstructured":"D.  Mitra, F.  Romeo and A.  Sangiovanni-Vincentelli,\nConvergence and finite-time behavior of simulated annealing,\nAdv. in Appl. Probab. 18 (1986), no. 3, 747\u2013771.\n10.2307\/1427186","DOI":"10.2307\/1427186"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_022_w2aab3b7b4b1b6b1ab1b5c22Aa","doi-asserted-by":"crossref","unstructured":"E.  Onba\u015fo\u011flu and L.  \u00d6zdamar,\nParallel simulated annealing algorithms in global optimization,\nJ. Global Optim. 19 (2001), no. 1, 27\u201350.\n10.1023\/A:1008350810199","DOI":"10.1023\/A:1008350810199"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_023_w2aab3b7b4b1b6b1ab1b5c23Aa","doi-asserted-by":"crossref","unstructured":"I.  Sant\u00e9, F. F.  Rivera, R.  Crecente, M.  Boull\u00f3n, M.  Su\u00e1rez, J.  Porta, J.  Parapar and R.  Doallo,\nA simulated annealing algorithm for zoning in planning using parallel computing,\nComp. Environ. Urban Syst. 59 (2016), 95\u2013106.\n10.1016\/j.compenvurbsys.2016.05.005","DOI":"10.1016\/j.compenvurbsys.2016.05.005"},{"key":"2023040102122321874_j_mcma-2019-2043_ref_024_w2aab3b7b4b1b6b1ab1b5c24Aa","doi-asserted-by":"crossref","unstructured":"A.  Sohn,\nGeneralized speculative computation of parallel simulated annealing,\nAnn. Oper. Res. 63 (1996), no. 1, 29\u201355.\n10.1007\/BF02601638","DOI":"10.1007\/BF02601638"}],"container-title":["Monte Carlo Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/mcma.2019.25.issue-3\/mcma-2019-2043\/mcma-2019-2043.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2019-2043\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2019-2043\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T00:43:08Z","timestamp":1680396188000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2019-2043\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,17]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,8,17]]},"published-print":{"date-parts":[[2019,9,1]]}},"alternative-id":["10.1515\/mcma-2019-2043"],"URL":"https:\/\/doi.org\/10.1515\/mcma-2019-2043","relation":{},"ISSN":["1569-3961","0929-9629"],"issn-type":[{"value":"1569-3961","type":"electronic"},{"value":"0929-9629","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8,17]]}}}