IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v38y2020i2p193-220.html
   My bibliography  Save this article

Genetic algorithm for quadratic assignment problems: application of Taguchi method for optimisation

Author

Listed:
  • T.G. Pradeepmon
  • Vinay V. Panicker
  • R. Sridharan

Abstract

Quadratic assignment problems (QAPs) are the hardest of combinatorial optimisation problems, with some problems of sizes of the order of 30 still remaining unsolved optimally. Solving QAPs with exact optimisation methods is cumbersome and hence, the use of non-conventional optimisation methods is recommended. Genetic algorithm (GA) being one of the most popular evolutionary algorithms is an appropriate choice for solving QAPs. The methods of operations used in GA influence the solution quality and thus, an optimal combination of parameters and operators are required for the efficient implementation of the algorithm. In this paper, the Taguchi's design of experiments method is used to find the best parameter combination and the best performing combination of operations for GA. The GA thus obtained by incorporating the selected parameter values and operators is then used for solving the QAPs taken from the QAP library. For many of the problems, it is found that the results obtained are within one percentage deviation from the best-known solutions.

Suggested Citation

  • T.G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2020. "Genetic algorithm for quadratic assignment problems: application of Taguchi method for optimisation," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 38(2), pages 193-220.
  • Handle: RePEc:ids:ijores:v:38:y:2020:i:2:p:193-220
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=107070
    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.

    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:ijores:v:38:y:2020:i:2:p:193-220. 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=170 .

    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.