IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v3y2008i6p644-672.html
   My bibliography  Save this article

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

Author

Listed:
  • Phen Chiak See
  • Kuan Yew Wong

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.

Suggested Citation

  • Phen Chiak See & Kuan Yew Wong, 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, Inderscience Enterprises Ltd, vol. 3(6), pages 644-672.
    • Handle: RePEc:ids:ijisen:v:3:y:2008:i:6:p:644-672
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=20679
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Komarudin & Wong, Kuan Yew, 2010. "Applying Ant System for solving Unequal Area Facility Layout Problems," European Journal of Operational Research, Elsevier, vol. 202(3), pages 730-746, May.
    2. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    3. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2021. "3D facility layout problem," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1065-1090, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisen:v:3:y:2008:i:6:p:644-672. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.