Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review
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 Q...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Inderscience Enterprises Ltd.
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/8751/ |
| _version_ | 1848891759003697152 |
|---|---|
| author | See, Phen Chiak Wong, Kuan Yew |
| author_facet | See, Phen Chiak Wong, Kuan Yew |
| author_sort | See, Phen Chiak |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T21:03:04Z |
| format | Article |
| id | utm-8751 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T21:03:04Z |
| publishDate | 2008 |
| publisher | Inderscience Enterprises Ltd. |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-87512022-04-29T21:53:52Z http://eprints.utm.my/8751/ Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review See, Phen Chiak Wong, Kuan Yew TJ Mechanical engineering and machinery 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. Inderscience Enterprises Ltd. 2008 Article PeerReviewed 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 http://dx.doi.org/10.1504/IJISE.2008.020679 DOI: 10.1504/IJISE.2008.020679 |
| spellingShingle | TJ Mechanical engineering and machinery See, Phen Chiak Wong, Kuan Yew Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| title | Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| title_full | Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| title_fullStr | Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| title_full_unstemmed | Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| title_short | Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| title_sort | application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review |
| topic | TJ Mechanical engineering and machinery |
| url | http://eprints.utm.my/8751/ http://eprints.utm.my/8751/ http://eprints.utm.my/8751/ |