Minimizing binary functions with simulated annealing algorithm with applications to binary tomography

Abstract The minimization of binary functions finds many applications in practice, and can be solved by the simulated annealing (SA) algorithm. However, the SA algorithm is designed for general combinatorial problems, not specifically for binary problems. Consequently, a direct application of the SA algorithm might not provide optimal performance and efficiency. Therefore, this study specifically investigated the performance of various implementations of the SA algorithm when applied to binary functions. Results obtained in this investigation demonstrated that 1) the SA algorithm can reliably minimize difficult binary functions, 2) a simple technique, analogous to the local search technique used in minimizing continuous functions, can exploit the special structure of binary problems and significantly improve the solution with negligible computational cost, and 3) this technique effectively reduces computational cost while maintaining reconstruction fidelity in binary tomography problems. This study also developed two classes of binary functions to represent the typical challenges encountered in minimization.

[1]  Attila Kuba,et al.  Multi-resolution method for binary tomography , 2005, Electron. Notes Discret. Math..

[2]  Lin Ma,et al.  Comparison of approaches based on optimization and algebraic iteration for binary tomography , 2010, Comput. Phys. Commun..

[3]  喜多 一 1996 IEEE International Conference on Evolutionary Computationに参加して , 1996 .

[4]  B. M. Fulk MATH , 1992 .

[5]  W. Press,et al.  Numerical Recipes in Fortran: The Art of Scientific Computing.@@@Numerical Recipes in C: The Art of Scientific Computing. , 1994 .

[6]  Marco Wiering,et al.  Proceedings of IEEE International Conference on Evolutionary Computation , 2013 .

[7]  Christoph Schnörr,et al.  Discrete tomography by convex-concave regularization and D.C. programming , 2005, Discret. Appl. Math..

[8]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[9]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[10]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[11]  Lin Ma,et al.  Applications of critical temperature in minimizing functions of continuous variables with simulated annealing algorithm , 2010, Comput. Phys. Commun..

[12]  Weiwei Cai,et al.  Numerical investigation of hyperspectral tomography for simultaneous temperature and concentration imaging. , 2008, Applied optics.

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[14]  Lester Ingber,et al.  Simulated annealing: Practice versus theory , 1993 .

[15]  S. Brooks,et al.  Optimization Using Simulated Annealing , 1995 .

[16]  Andrew G. Glen,et al.  APPL , 2001 .

[17]  William H. Press,et al.  Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[18]  G. Herman,et al.  Discrete tomography : foundations, algorithms, and applications , 1999 .

[19]  Mark Fielding,et al.  Simulated Annealing With An Optimal Fixed Temperature , 2000, SIAM J. Optim..

[20]  M. E. Johnson,et al.  Generalized simulated annealing for function optimization , 1986 .

[21]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[22]  Rocio Gonzalez-Diaz,et al.  Discrete Geometry for Computer Imagery , 2013, Lecture Notes in Computer Science.