The ant system applied to the quadratic assignment problem

被引：342
|
作者：
Maniezzo, V
Colorni, A
机构：
[1] Univ Bologna, Dipartimento Informat, I-47023 Cesna, Italy
[2] Politecn Milan, Dipartimento Elettron & Informat, I-20133 Milan, Italy
来源：
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 1999年 / 11卷 / 05期
关键词：
heuristic algorithms; distributed algorithms; ant system; evolutionary computation; quadratic assignment problem; combinatorial optimization; knowledge pooling;
D O I：
10.1109/69.806935
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures that can solve complex problems. In this article, we describe a distributed heuristic algorithm that was inspired by the observation of the behavior of ant colonies, and we propose its use for the Quadratic Assignment Problem. The results obtained in solving several classical instances of the problem are compared with those obtained from other evolutionary heuristics to evaluate the quality of the proposed system.
引用
收藏
页码：769 / 778
页数：10
相关论文
共 50 条
12345