Optimization of the quadratic assignment problem using an ant colony algorithm

Demirel N. C., Toksari M. D.

APPLIED MATHEMATICS AND COMPUTATION, cilt.183, sa.1, ss.427-435, 2006 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 183 Sayı: 1
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1016/j.amc.2006.05.073
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.427-435
  • Anahtar Kelimeler: ant colony optimization, simulated annealing, metaheuristics, quadratic assignment problem, combinatorial optimization
  • Erciyes Üniversitesi Adresli: Hayır

Özet

Ant algorithm is a multi-agent systems inspired by the behaviors of real ant colonies function to solve optimization problems. In this paper an ant colony optimization algorithm is developed to solve the quadratic assignment problem. The local search process of the algorithm is simulated annealing. In the exploration of the search space, the evaluation of pheromones which are laid on the ground by ants is used. In this work, the algorithm is analyzed by using current problems in the literature and is compared with other metaheuristics. (c) 2006 Elsevier Inc. All rights reserved.