 A genetic ant colony optimisation system (GenANT) for quadratic assignment problemsKuan Yew Wong and Phen Chiak See International Journal of Mathematics in Operational Research, 2009, vol. 1, issue 4, 456-475 Abstract: In recent years, various metaheuristic approaches have been created to solve quadratic assignment problems (QAPs). Among others is the ant colony optimisation (ACO) algorithm, which was inspired by the foraging behaviour of ants. Although it has solved some QAPs successfully, it still contains some weaknesses and is unable to solve large QAP instances effectively. Thereafter, various suggestions have been made to improve the performance of the ACO algorithm. One of them is to hybridise ACO with other metaheuristic algorithms. Particularly, there is an increasing interest to hybridise ACO with genetic algorithm (GA) to obtain better search performance. This article introduces a new hybrid ACO algorithm known as GenANT, which combines the max-min ant system (MMAS; i.e. a type of ACO algorithm) with GA to solve QAPs. A novel minimum pheromone threshold strategy is also introduced to enhance the collaboration between MMAS and GA. An experimental evaluation on the performance of GenANT is presented at the end of the article following by conclusions. Keywords: ACO; ant colony optimisation; GAs; genetic algorithms; MMAS; max-min ant systems; QAPs; quadratic assignment problems; metaheuristics. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:1:y:2009:i:4:p:456-475 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.