Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm

AKAY B., KARABOĞA D.

11th Congress of the Italian-Association-for-Artificial-Intelligence, Reggio Emilia, İtalya, 9 - 12 Aralık 2009, cilt.5883, ss.355-364 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 5883
  • Doi Numarası: 10.1007/978-3-642-10291-2_36
  • Basıldığı Şehir: Reggio Emilia
  • Basıldığı Ülke: İtalya
  • Sayfa Sayıları: ss.355-364
  • Erciyes Üniversitesi Adresli: Evet

Özet

This paper presents a study that applies the Artificial Bee Colony algorithm to integer programming problems and compares its performance with those of Particle Swarm Optimization algorithm variants and Branch and Bound technique presented to the literature. In order to cope with integer programming problems, in neighbour solution production unit, solutions are truncated to the nearest integer values. The experimental results show that Artificial Bee Colony algorithm can handle integer programming problems efficiently and Artificial Bee Colony algorithm can be considered to be very robust by the statistics calculated such as mean, median, standard deviation.