Abstract
In this work, a simulated annealing (SA) algorithm is implemented in the Python programming language with the aim of minimizing addition chains of the "star-chain" type. The strategies for generating and mutating individuals are similar to those used by the evolutionary programming (EP) and genetic algorithms (GA) methods found in the literature [1]-[3]. The proposed variant is the acceptance mechanism that is based on the simulated annealing meta-heuristic (SA). The hypothesis is that with the proposed acceptance mechanism, diversity is obtained in the search-space through a simple strategy that allows finding better solutions compared to the deterministic method Optimized Window. The simulations were performed with exponents in the range 218-234 and were compared with the results reported in [3], where a GA is proposed to get optimal addition chains. It is concluded that the proposed algorithm is able to find chains of shorter length than those found with the Optimized Window method and with a performance similar to that of the GA proposed in [3].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: European Journal of Electrical Engineering and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
