Universiti Teknologi Malaysia Institutional Repository

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

See, Phen Chiak and Wong, Kuan Yew (2008) Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review. International Journal of Industrial and Systems Engineering, 3 (6). ISSN 1748-5037

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1504/IJISE.2008.020679

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.

Item Type:Article
Uncontrolled Keywords:facility layout optimisation, metaheuristics, QAP
Subjects:T Technology > TJ Mechanical engineering and machinery
Divisions:Mechanical Engineering
ID Code:8751
Deposited By: Narimah Nawil
Deposited On:08 May 2009 10:26
Last Modified:29 Apr 2022 21:53

Repository Staff Only: item control page