Degeneration vs Classical of simulated annealing algorithm: performance analysis

An energy system is said degenerate if it corresponds to several distinct states of an atom or other quantum system. the degeneration simulated annealing algorithm (DSA) is a proposed variant of simulated annealing algorithm. The DSA is based on a process to search the optimal energy state (optimal solution), by subdividing the search system on two distinct search subsystems. In this paper, we analyze the effectiveness of the degeneration simulated annealing compared to the classical simulated annealing algorithm, by analyzing the annealing process to converge to the optimal state (solution), we use as a NP hard problem the estimate of the minimum distance value for BCH(127,64) and BCH(255,91).