A Hybrid Approach Based on Ant System for the Quadratic Assignment Problem

摘要：

Ant algorithms are a recently developed, population-based approach which was inspired by the observation of the behavior of ant colonies and we propose its use for the Quadratic Assignment Problem. In this paper, through an analysis of the constructive procedure of the solution in the Ant System (AS), we present a modified ant algorithm which Hybridized with Randomized Algorithm (HRAS). In HRAS, only partial facilities are randomly chosen to compute the designed probability. Experimental results for solving the Quadratic Assignment Problem (QAP) with both AS and HRAS demonstrate that the proposed approach can obtain the better quality of the solutions.

关键词： Ant System Combinatorial Optimization Randomized Algorithm QAP

作者: Chengming Qi

作者单位: the College of Automation, Beijing Union University Beijing, 100101, China

会议类型: 国际会议

会议名称: The Second International Symposium on Intelligence Computation and Applications(ISICA 2007)(第二届智能计算及其应用国际会议)

会议地点: 武汉

会议语种:英文

在线出版日期: 2007-09-21（万方平台首次上网日期，不代表论文的发表时间）