IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v30y1983i2p287-304.html
   My bibliography  Save this article

A branch‐and‐bound‐based heuristic for solving the quadratic assignment problem

Author

Listed:
  • M. S. Bazaraa
  • O. Kirca

Abstract

In this article a branch‐and‐bound algorithm is proposed for solving the quadratic assignment problem. Using symmetric properties of the problem, the algorithm eliminates “mirror image” branches, thus reducing the search effort. Several routines that transform the procedure into an efficient heuristic are also implemented. These include certain 2‐way and 4‐way exchanges, selective branching rules, and the use of variable upper‐bounding techniques for enhancing the speed of fathoming. The computational results are quite encouraging. As an exact scheme, the algorithm solved the 12‐facility problem of Nugent et al. and the 19‐facility problem of Elshafei. More importantly, as a heuristic, the procedure produced the best known solutions for all well‐known problems in the literature, and produced improved solutions in several cases.

Suggested Citation

  • M. S. Bazaraa & O. Kirca, 1983. "A branch‐and‐bound‐based heuristic for solving the quadratic assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(2), pages 287-304, June.
    • Handle: RePEc:wly:navlog:v:30:y:1983:i:2:p:287-304
    DOI: 10.1002/nav.3800300210
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800300210
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800300210?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:navlog:v:30:y:1983:i:2:p:287-304. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.