Assessment guidelines for ant colony algorithms when solving quadratic assignment problems

Phen Chiak See, Kuan Yew Wong, Komarudin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

To date, no consensus exists on how to evaluate the performance of a new Ant Colony Optimization (ACO) algorithm when solving Quadratic Assignment Problems (QAPs). Different performance measures and problems sets are used by researchers to evaluate their algorithms. This paper is aimed to provide a recapitulation of the relevant issues and suggest some guidelines for assessing the performance of new ACO algorithms.

Original languageEnglish
Title of host publicationComputational Methods in Science and Engineering - Advances in Computational Science, Lectures Presented at the Int. Conference on Computational Methods in Science and Engineering 2008, ICCMSE 2008
Pages865-867
Number of pages3
DOIs
Publication statusPublished - 1 Dec 2009
Event6th International Conference on Computational Methods in Sciences and Engineering 2008, ICCMSE 2008 - Hersonissos, Crete, Greece
Duration: 25 Sep 200830 Sep 2008

Publication series

NameAIP Conference Proceedings
Volume1148 2
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference6th International Conference on Computational Methods in Sciences and Engineering 2008, ICCMSE 2008
CountryGreece
CityHersonissos, Crete
Period25/09/0830/09/08

Keywords

  • Ant Colony Optimization
  • Performance Evaluation
  • Quadratic Assignment Problems

Fingerprint Dive into the research topics of 'Assessment guidelines for ant colony algorithms when solving quadratic assignment problems'. Together they form a unique fingerprint.

Cite this