Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems


APPLIED MATHEMATICAL MODELLING, vol.37, pp.7822-7838, 2013 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 37
  • Publication Date: 2013
  • Doi Number: 10.1016/j.apm.2013.01.045
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.7822-7838
  • Keywords: Multiobjective ant colony optimization (MOACO) algorithms, Biobjective quadratic assignment problem (BiQAP), Multiobjective optimization, OPTIMIZATION, LAYOUT, DESIGN
  • Kocaeli University Affiliated: Yes


The difficulty of resolving the multiobjective combinatorial optimization problems with traditional methods has directed researchers to investigate new approaches which perform better. In recent years some algorithms based on ant colony optimization (ACO) metaheuristic have been suggested to solve these multiobjective problems. In this study these algorithms have been reported and programmed both to solve the biobjective quadratic assignment problem (BiQAP) instances and to evaluate the performances of these algorithms. The robust parameter sets for each 12 multiobjective ant colony optimization (MOACO) algorithms have been calculated and BiQAP instances in the literature have been solved within these parameter sets. The performances of the algorithms have been evaluated by comparing the Pareto fronts obtained from these algorithms. In the evaluation step, a multi significance test is used in a non hierarchical structure, and a performance metric (P metric) essential for this test is introduced. Through this study, decision makers will be able to put in the biobjective algorithms in an order according to the priority values calculated from the algorithms' Pareto fronts. Moreover, this is the first time that MOACO algorithms have been compared by solving BiQAPs. Crown Copyright (C) 2013 Published by Elsevier Inc. All rights reserved.