Dynamic Differential Annealed Optimization (DDAO)

This work proposes a novel optimization algorithm which can be used to solve a wide range of mathematical optimization problems where the global minimum or maximum is required. The new algorithm is based on random search and classical simulated annealing algorithm (it mimics the modern process of producing high-quality steel) and is designated dynamic differential annealed optimization (DDAO). The proposed algorithm was benchmarked for 51 test functions. The dynamic differential annealed optimization algorithm has been compared to a large number of highly cited optimization algorithms. Over numerical tests, DDAO has outperformed some of these algorithms in many cases and shown high performance. Constrained path planning and spring design problem were selected as a practical engineering optimization problem. DDAO converged to the global minimum of problems efficiently, and for spring design problem DDAO has found the best feasible solution than what is found by many algorithms.