期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2014
卷号：5
期号：4
页码：5950-5956
出版社：TechScience Publications
摘要：In this paper a hybrid variant of meta-heuristic algorithm ant colony optimization (ACO) is used. Approximate solutions to quadratic assignment problem have been proved very efficient. Different variants of ant colony optimization have been applied to QAP. But in this paper a hybrid approach is proposed which is combination of Ant system and Max-Min Ant system to take benefits of both the methods. In this approach solution construction phase is in accordance with Max-Min system and pheromone updation phase is according to Ant System. This hybrid approach is accompanied by local search technique. In this paper a comparative analysis is done using QAPLIB and it is found that results are improved and are comparable with Ant system and Max-Min ant system algorithm.
关键词：Quadratic Assignment Problem; Meta-Heuristic;Ant Colony Optimization; 2-opt iterative local search
