A genetic ant colony optimisation system (GenANT) for quadratic assignment problems
by Kuan Yew Wong, Phen Chiak See
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 4, 2009

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.

Online publication date: Fri, 05-Jun-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com