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.
Reference31 articles.
1. [1] Yıldırım AE. Yapay atom algoritması ve ayrık problemlere uygulanması (in Turkish). PhD. Thesis, Institute of Natural and Applied Science, Malatya: Inonu University, Turkey; 2018.
2. [2] Pérez J, Valdez F, Castillo O. Bat algorithm comparison with genetic algorithm using benchmark functions. In: Castillo O, Melin P, Pedrycz W, Kacprzyk J. (eds) Recent Advances on Hybrid Approaches for Designing Intelligent Systems. Studies in Computational Intelligence, 547, Springer, Cham; 2014.
3. [3] Onwubolu GC, Clerc M. Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 2004; 42(3), 473–491.
4. [4] Karcı A. Theory of saplings growing up algorithm. In: Beliczynski B, Dzielinski A, Iwanowski M, Ribeiro B. (Ed.), Adaptive and Natural Computing Algorithms. Lecture Notes in Computer Science, 4431, 450-460, Springer, Berlin, Heidelberg; 2007.
5. [5] Wong LP, Low MYH, Chong CS. A bee colony optimization algorithm for traveling salesman problem. Proceedings of Second Asia International Conference on Modelling & Simulation (AMS), Kuala Lumpur, Malaysia; 2008.