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

doi:10.1016/j.cpc.2011.10.011

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

2012-02-01

15

PRE

AI

DOI：10.1016/j.cpc.2011.10.011

Original

Original request for help

Save

Abstract

En 中文

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 I) 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. (C) 2011 Elsevier B.V. All rights reserved.

Keywords:

Binary function

Simulated annealing

Discrete tomography

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

Abstract

AI Summary

Journal

Organization