Abstract
Simulated Annealing is one of the important evolutionary algorithms which can be used in many applications especially in optimization problems. Simulated Annealing has two main phases, the first one is annealing schedule and the second is acceptance probability function. I proposed three annealing schedule methods and one acceptance probability function. The idea of adding momentum terms was used to improve speed and accuracy of annealing schedulers and prevent extreme changes in values of acceptance probability function. Some of my proposed methods show a good accuracy and the others make significant improvement in the speed of simulated Annealing algorithms than the original functions which have been used in the original simulated annealing algorithm.
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 callDisclaimer: 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.
