A New Dynamic Simulated Annealing Algorithm for Global Optimization


Authors

Hasan Yarmohamadi - Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran. Jahanshah Kabudian - Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran. Seyed Hanif Mirhosseini - Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran.


Abstract

Many problems in system analysis in real world lead to continuous-domain optimization. Existence of sophisticated and many-variable problems in this field emerge need of efficient optimization methods. One of the optimization algorithms for multi-dimensional functions is simulated annealing (SA). In this paper, a modified simulated annealing named Dynamic Simulated Annealing (DSA) is proposed which dynamically switch between two types of generating function on traversed path of continuous Markov chain. Our experiments indicate that this approach can improve convergence and stability and avoid delusive areas in benchmark functions better than SA without any extra mentionable computational cost.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Hasan Yarmohamadi, Jahanshah Kabudian, Seyed Hanif Mirhosseini, A New Dynamic Simulated Annealing Algorithm for Global Optimization, Journal of Mathematics and Computer Science, 14 (2015), no. 1, 16-23

AMA Style

Yarmohamadi Hasan, Kabudian Jahanshah, Mirhosseini Seyed Hanif, A New Dynamic Simulated Annealing Algorithm for Global Optimization. J Math Comput SCI-JM. (2015); 14(1):16-23

Chicago/Turabian Style

Yarmohamadi, Hasan, Kabudian, Jahanshah, Mirhosseini, Seyed Hanif. "A New Dynamic Simulated Annealing Algorithm for Global Optimization." Journal of Mathematics and Computer Science, 14, no. 1 (2015): 16-23


Keywords


MSC


References