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...

Full description

Bibliographic Details
Main Authors: See, Phen Chiak, Wong, Kuan Yew
Format: Article
Published: Inderscience Enterprises Ltd. 2008
Subjects:
_version_ 1796854449804673024
author See, Phen Chiak
Wong, Kuan Yew
author_facet See, Phen Chiak
Wong, Kuan Yew
author_sort See, Phen Chiak
collection ePrints
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 2024-03-05T18:14:15Z
format Article
id utm.eprints-8751
institution Universiti Teknologi Malaysia - ePrints
last_indexed 2024-03-05T18:14:15Z
publishDate 2008
publisher Inderscience Enterprises Ltd.
record_format dspace
spelling utm.eprints-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
work_keys_str_mv AT seephenchiak applicationofantcolonyoptimisationalgorithmsinsolvingfacilitylayoutproblemsformulatedasquadraticassignmentproblemsareview
AT wongkuanyew applicationofantcolonyoptimisationalgorithmsinsolvingfacilitylayoutproblemsformulatedasquadraticassignmentproblemsareview