An Improved Artificial Atom Algorithm With the Operator of Shuffled Frog Leaping Algorithm

Abstract

Artificial Atom Algorithm is an optimization technique that developed inspired by nature. This algorithm used for both continues problems and discrete problems in previous studies. In this study, an arrangement that would increase the success of this algorithm was envisaged. For this purpose, the ionic bond function of Artificial Atom Algorithm has been improved benefiting an algorithmic step of Shuffled Frog Leaping Algorithm. As a result of the updates, the search space was narrowed for the ionic bond operator. Thus, the state of getting away from the solution in each iteration was prevented. The success of Improved Artificial Atom Algorithm was tested with benchmark functions. Experimental results for the proposed method were interpreted comparatively.