Parallel artificial bee colony algorithm for traveling salesman problem Gezgin satici problemi için paralel yapay ari koloni algoritmas?

AKAY R., BAŞTÜRK A.

2014 22nd Signal Processing and Communications Applications Conference, SIU 2014, Trabzon, Türkiye, 23 - 25 Nisan 2014, ss.501-505 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu.2014.6830275
  • Basıldığı Şehir: Trabzon
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.501-505
  • Anahtar Kelimeler: artificial bee colony algorithm, parallel programing, traveling salesmen problem
  • Erciyes Üniversitesi Adresli: Evet

Özet

In this study, we proposed a parallel implementation of the combinatorial type artificial bee colony algorithm which has an efficient neighbor production mechanism. Running time and performance tests of the proposed parallel model were carried on the traveling salesmen problem. Results show that parallel artificial bee colony algorithm decreases the running time due to exploiting the computational power of parallel computing systems. Beside, better quality solutions are obtained compared to the reproduction methods of the genetic algorithm. © 2014 IEEE.