The design of hybrid metaheuristics with ideas taken from the simulated annealing and evolutionary algorithms fields is a fruitful research line. In this paper, we first present an overview of the hybrid metaheuristics based on simulated annealing and evolutionary algorithms presented in the literature and classify them according to two well-known taxonomies of hybrid methods. Second, we perform an empirical study comparing the behavior of a representative set of the hybrid approaches based on evolutionary algorithms and simulated annealing found in the literature. In addition, a study of the synergy relationships provided by these hybrid approaches is presented. Finally, we analyze the behavior of the best performing hybrid metaheuristic with regard to several state-of-the-art evolutionary algorithms for binary combinatorial problems. The experimental studies presented provide useful conclusions about the schemes for combining ideas from simulated annealing and evolutionary algorithms that may improve the performance of these kinds of approaches and suggest that these hybrids metaheuristics represent a competitive alternative for binary combinatorial problems.