Optimization of the quadratic assignment problem using an ant colony algorithm

Demirel N. C., Toksari M. D.

APPLIED MATHEMATICS AND COMPUTATION, vol.183, no.1, pp.427-435, 2006 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 183 Issue: 1
  • Publication Date: 2006
  • Doi Number: 10.1016/j.amc.2006.05.073
  • Journal Name: APPLIED MATHEMATICS AND COMPUTATION
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.427-435
  • Keywords: ant colony optimization, simulated annealing, metaheuristics, quadratic assignment problem, combinatorial optimization
  • Erciyes University Affiliated: No

Abstract

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.