Abstract
We introduce a parallel scheme for simulated annealing, a widely used Markov chain Monte Carlo (MCMC) method for optimization. Our method is constructed and analyzed under the classical framework of MCMC. The benchmark function for optimization is used for validation and verification of the parallel scheme. The 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.
References
[1] E. H. L. Aarts and P. J. M. van Laarhoven, Statistical cooling: A general approach to combinatorial optimization problems, Philips J. Res. 40 (1985), no. 4, 193–226. Search in Google Scholar
[2] D. Abramson, Constructing school timetables using simulated annealing: Sequential and parallel algorithms, Manag. Sci. 37 (1991), no. 1, 98–113. 10.1287/mnsc.37.1.98Search in Google Scholar
[3] K. D. Boese, Models for Iterative Global Optimization, PhD thesis, University of California, Los Angeles, 1996. Search in Google Scholar
[4] Y.-L. Chang, J.-P. Fang, W.-Y. Liang, L. Chang, H. Ren and K.-S. Chen, A parallel simulated annealing approach to band selection for hyperspectral imagery, 2008 IEEE International Geoscience and Remote Sensing Symposium—IGARSS 2008, IEEE Press, Piscataway (2008), 10.1109/IGARSS.2008.4779164. 10.1109/IGARSS.2008.4779164Search in Google Scholar
[5] D.-J. Chen, C.-Y. Lee, C.-H. Park and P. Mendes, Parallelizing simulated annealing algorithms based on high-performance computer, J. Global Optim. 39 (2007), no. 2, 261–289. 10.1007/s10898-007-9138-0Search in Google Scholar
[6] H. Chen, N. S. Flann and D. W. Watson, Parallel genetic simulated annealing: A massively parallel simd algorithm, IEEE Trans. Parallel Distrib. Syst. 9 (1998), no. 2, 126–136. 10.1109/71.663870Search in Google Scholar
[7] K.-W. Chu, Y. Deng and J. Reinitz, Parallel simulated annealing by mixing of states, J. Comput. Phys. 148 (1999), no. 2, 646–662. 10.1006/jcph.1998.6134Search in Google Scholar
[8] A. M. Ferreiro, J. A. García, J. G. López-Salas and C. Vázquez, An efficient implementation of parallel simulated annealing algorithm in GPUs, J. Global Optim. 57 (2013), no. 3, 863–890. 10.1007/s10898-012-9979-zSearch in Google Scholar
[9] A. O. Griewank, Generalized descent for global optimization, J. Optim. Theory Appl. 34 (1981), no. 1, 11–39. 10.1007/BF00933356Search in Google Scholar
[10] B. Hajek, Cooling schedules for optimal annealing, Math. Oper. Res. 13 (1988), no. 2, 311–329. 10.1287/moor.13.2.311Search in Google Scholar
[11] A.-R. Hedar and M. Fukushima, Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization, Optim. Methods Softw. 17 (2002), no. 5, 891–912. 10.1080/1055678021000030084Search in Google Scholar
[12] M. D. Huang, An efficient general cooling schedule for simulated annealing, Computational Science and Its Applications—ICCSA 2004, Lecture Notes in Comput. Sci. 3045, Springer, Berlin (1986), 381–384. Search in Google Scholar
[13] D. Janaki Ram, T. H. Sreenivas and K. Ganapathy Subramaniam, Parallel simulated annealing algorithms, J. Parallel Distrib. Comp. 37 (1996), no. 2, 207–212. 10.1006/jpdc.1996.0121Search in Google Scholar
[14] S. Kirkpatrick, C. D. Gelatt, Jr. and M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983), no. 4598, 671–680. 10.1126/science.220.4598.671Search in Google Scholar PubMed
[15] M.-Y. Ku, M. H. Hu and M.-J. Wang, Simulated annealing based parallel genetic algorithm for facility layout problem, Int. J. Production Res. 49 (2011), no. 6, 1801–1812. 10.1080/00207541003645789Search in Google Scholar
[16] J. K.-C. Lam, An efficient simulated annealing schedule, PhD thesis, Yale University, 1989. Search in Google Scholar
[17] N. Li, J. Cha and Y. Lu, A parallel simulated annealing algorithm based on functional feature tree modeling for 3d engineering layout design, Appl. Soft Comput. 10 (2010), no. 2, 592–601. 10.1016/j.asoc.2009.08.033Search in Google Scholar
[18] Z. Lou, A massively scalable parallel simulated annealing algorithm, PhD thesis, University of Chicago, 2016. Search in Google Scholar
[19] Z. Lou and J. Reinitz, Parallel simulated annealing using an adaptive resampling interval, Parallel Comput. 53 (2016), 23–31. 10.1016/j.parco.2016.02.001Search in Google Scholar PubMed PubMed Central
[20] M. Miki, T. Hiroyasu, K. Ono and T. Fushimi, Temperature parallel simulated annealing with advanced adaptive neighborhood, IPSJ J. 44 (2003), no. 12, 3123–3130. Search in Google Scholar
[21] D. Mitra, F. Romeo and A. Sangiovanni-Vincentelli, Convergence and finite-time behavior of simulated annealing, Adv. in Appl. Probab. 18 (1986), no. 3, 747–771. 10.2307/1427186Search in Google Scholar
[22] E. Onbaşoğlu and L. Özdamar, Parallel simulated annealing algorithms in global optimization, J. Global Optim. 19 (2001), no. 1, 27–50. 10.1023/A:1008350810199Search in Google Scholar
[23] I. Santé, F. F. Rivera, R. Crecente, M. Boullón, M. Suárez, J. Porta, J. Parapar and R. Doallo, A simulated annealing algorithm for zoning in planning using parallel computing, Comp. Environ. Urban Syst. 59 (2016), 95–106. 10.1016/j.compenvurbsys.2016.05.005Search in Google Scholar
[24] A. Sohn, Generalized speculative computation of parallel simulated annealing, Ann. Oper. Res. 63 (1996), no. 1, 29–55. 10.1007/BF02601638Search in Google Scholar
© 2019 Walter de Gruyter GmbH, Berlin/Boston
