.png){kind=icon}
返回
Optimization of the quadratic assignment problem using an ant colony algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.073.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
ant colony optimization
simulated annealing
metaheuristics
quadratic assignment problem
combinatorial optimization
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Role of nitrogen (N) in plant growth, photosynthesis pigments, and N use efficiency: A. review.png)
OAAI
IF0
OAAI分享收藏Predictive risk stratification model: a progressive cluster-randomised trial in chronic conditions management (PRISMATIC) research protocolTrials
OAAI
TrialsIF0
OAAI分享收藏
查看更多内容