文献类型：会议论文

英文题名：A modified ant algorithm for solving the quadratic assignment problem

作者：Qi, Chengming[1]

第一作者：亓呈明

通讯作者：Qi, C[1]

机构：[1]Beijing Union Univ, Coll Automat, Beijing 100101, Peoples R China

第一机构：北京联合大学城市轨道交通与物流学院

通讯机构：[1]corresponding author), Beijing Union Univ, Coll Automat, Beijing 100101, Peoples R China.|[1141751]北京联合大学城市轨道交通与物流学院;[11417]北京联合大学;

会议论文集：International Conference on Intelligent Pervasive Computing (IPC 2007)

会议日期：OCT 11-13, 2007

会议地点：Cheju Isl, SOUTH KOREA

语种：英文

外文关键词：ant system; combinatorial optimization; randomized algorithm; QAP

摘要：The Quadratic Assignment Problem(QAP) is one of the hardest combinatorial optimization problems known. Ant algorithms have been inspired by the behavior of real ant colonies. In this paper, we introduce random algorithm to the constructive procedure of the solution of Ant System (AS) and adopt dynamic adaptive approach to update pheromone trails. In our algorithm, only partial facilities are randomly chosen to compute the designed probability. Experimental results for solving the QAP demonstrate that the proposed approach can obtain the better quality of the solutions.