Applications of artificial atom algorithm to small-scale traveling salesman problems

YILDIRIM A. E., KARCI A.

SOFT COMPUTING, cilt.22, sa.22, ss.7619-7631, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 22 Sayı: 22
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1007/s00500-017-2735-z
  • Dergi Adı: SOFT COMPUTING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.7619-7631
  • İnönü Üniversitesi Adresli: Evet

Özet

Most of the meta-heuristic algorithms are based on the natural processes. They were inspired by physical, biological, social, chemical, social-biological, biological-geography, music, and hybrid processes. In this paper, artificial atom algorithm which was inspired by one of natural processes was applied to traveling salesman problem. The obtained results have shown that for small-scale TSP, artificial atom algorithm is closer to optimum than the other compared heuristic algorithms such as tabu search, genetic algorithm, particle swarm optimization, ant colony optimization, and their different combinations.