Frausto-Solís, JuanJuanFrausto-SolísMartínez Ríos, Félix OrlandoFélix OrlandoMartínez Ríos2023-07-132023-07-132008https://scripta.up.edu.mx/handle/20.500.12552/370710.1109/MICAI.2008.68Since the appearance of Simulated Annealing (SA) algorithm it has shown to be an efficient method to solve combinatorial optimization problems. This algorithm is based on two cycles: the external or temperature cycle and the internal or Metropolis Cycle. In this paper a new SA method named LRSA is presented. LRSA dynamically finds the equilibrium in the Metropolis cycle by using Linear Regression. Experimentation shows that the proposed method is more efficient than the classical one, since it obtains the same quality in the final solution with less processing time.enSimulated AnnealingCooling SchemeDynamic Markov ChainsCombinatorial OptimizationHeuristic OptimizationSatisfiability problemResource Types::text::conference output::conference proceedings::conference paper