Int. J. of Industrial and Systems Engineering   »   2008 Vol.3, No.6

 

 

Title: Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review

 

Author: Phen Chiak See, Kuan Yew Wong

 

Addresses:
Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia.
Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia

 

Abstract: The formulation of Facility Layout Problems (FLPs) as Quadratic Assignment Problems (QAPs) has gained substantial attention from researchers. The main reason is that, QAPs provide possibilities to solve FLPs computationally. To date, there are two common approaches used to solve FLPs formulated as QAPs, that is, exact methods and approximate methods (also known as heuristics). In recent years, there is an increasing interest in solving QAPs using the general extension of heuristic methods called metaheuristics. Ant Colony Optimisation (ACO) has currently emerged as a new and promising metaheuristic. This paper is aimed to provide a comprehensive review of the concepts of ACO and its application in solving QAPs. In addition, the various ACO algorithms or variants developed to solve them are critically analysed and discussed. It is shown that these existing algorithms still possess many limitations and weaknesses. Finally, useful strategies and research directions are provided to improve these weaknesses.

 

Keywords: facility layout optimisation; metaheuristics; QAP; quadratic assignment problems; ACO; ant colony optimisation.

 

DOI: 10.1504/IJISE.2008.020679

 

Int. J. of Industrial and Systems Engineering, 2008 Vol.3, No.6, pp.644 - 672

 

Available online: 10 Oct 2008

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article