logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Optimization of the quadratic assignment problem using an ant colony algorithm

delete2006-12-01
delete60
PRE
AI
N
Nihan Çetin Demirel
M
M. Duran Toksarı *
DOI：10.1016/j.amc.2006.05.073delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
ant colony optimization
simulated annealing
metaheuristics
quadratic assignment problem
combinatorial optimization

Journal

Applied Mathematics and Computation cover
Applied Mathematics and Computation
IF:
3.4
Papers:
2.3W
Citations:
3.3W

Organization

No organization information available